Skip to main content

Publications

2001

ISRAEL JOURNAL OF MATHEMATICS, 124, pp. 185-188.

Deciding finiteness for matrix semigroups over function fields over finite fields

Authors
Ivanyos, Gábor
Read more
2005

In: Informatikai Algoritmusok ELTE Eötvös K., Budapest, pp. 838-892.

Algebra

Authors
Ivanyos, Gábor
Rónyai, Lajos
Editors
Iványi, A
Read more
2005

PHYSICAL REVIEW A, 72, pp. 022339-1-022339-9.

Quantum computing on lattices using global two-qubit gates

Authors
Ivanyos, Gábor
Massar, S.
Nagy, AB
Read more
2005

LECTURE NOTES IN COMPUTER SCIENCE, 3623, pp. 234-246.

On the black-box complexity of Sperner's Lemma

Authors
Friedl, K.
Ivanyos, Gábor
Santha, M.
Verhoeven, YF
Read more
2005

In: STOC�05. Proceedings of the 37th annual ACM symposium on theory of computing. Baltimore, 2005..

Efficient testing of groups

Authors
Friedl, K.
Ivanyos, Gábor
Santha, M.
Read more
2009-07-28

In: ISSAC 2009. International symposium on symbolic and algebraic computation. Seoul, 2009..

Schemes for deterministic polynomial factoring

Authors
Ivanyos, Gábor
Karpinski, Marek
Saxena, Nitin
Editors
Johnson, J.
Park, H.
Kaltofen, E.
Read more
2001

In: 13th annual symposium on parallal algorithms and architectures. SPAA 2001. Crete Island, Proceedings..

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Authors
Ivanyos, Gábor
Magniez, F.
Sántha, M.
Read more
2009

Theory of Computing Systems, 45, pp. 629-646.

On the black-box complexity of Sperner's Lemma

Authors
Friedl, Katalin
Ivanyos, Gábor
Santha, Miklos
Verhoeven, Yves F.
Read more