22 citations · 45 across the 13 of their papers we have counts for
16 papers
A note on linear Sperner families
Gábor Hegedüs, Lajos Rónyai
In an earlier work we described Gröbner bases of the ideal of polynomials over a field, which vanish on the set of characteristic vectors of the complete…
Explicit equivalence of quadratic forms over
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over , where is a finite…
Incomplete pairwise comparison matrices and weighting methods
László Csató, Lajos Rónyai
A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is ava…
Computing explicit isomorphisms with full matrix algebras over
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
We propose a polynomial time -algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over ) for computing an isomorphism (i…
Shattering-extremal set systems of VC dimension at most 2
Tamás Mészáros, Lajos Rónyai
We say that a set system shatters a given set if . The Sauer inequality states that in general…
Resilient Flow Decomposition of Unicast Connections with Network Coding
Peter Babarczi, Janos Tapolcai, Lajos Ronyai +1
In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, w…