Skip to main content

Publications

2018

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 92, pp. 48-64. ISSN 0022-0000

On the complexity of trial and error for constraint satisfaction problems

Authors
Ivanyos, Gábor
Kulkarni, R
Qiao, YM
Santha, M
Sundaram, A
Read more
2018

ERCIM NEWS (112)., pp. 28-29. ISSN 0926-4981

Chevalley-Warning Theorem in Quantum Computing

Authors
Ivanyos, Gábor
Rónyai, Lajos
Read more
2014

QUANTUM INFORMATION & COMPUTATION, 14 (9-10)., pp. 790-806. ISSN 1533-7146

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems

Authors
Decker, Thomas
Høyer, Peter
Ivanyos, Gábor
Santha, Miklos
Read more
2018

ALGORITHMICA, 80 (2)., pp. 560-575. ISSN 0178-4617

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields

Authors
Ivanyos, Gábor
Karpinski, M
Santha, M
Saxena, N
Shparlinski, IE
Read more
2018

COMPUTATIONAL COMPLEXITY, 27 (4)., pp. 561-593. ISSN 1016-3328

Constructive non-commutative rank computation is in deterministic polynomial time

Authors
Ivanyos, Gábor
Qiao, Y.
Subrahmanyam, K.V.
Read more
2014

Quantum Information and Computation, 14, pp. 790-806.

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems

Authors
Decker, Thomas
Hoyer, Peter
Ivanyos, Gábor
Santha, Miklos
Read more
2014

LECTURE NOTES IN COMPUTER SCIENCE, 8572, pp. 663-675. ISSN 0302-9743

On the complexity of trial and error for constraint satisfaction problems

Authors
Ivanyos, Gábor
Kulkarni, Raghav
Qiao, Youming
Santha, Miklos
Sundaram, Aarthi
Read more
2018

In: 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 Society for Industrial and Applied Mathematics (SIAM), Philadelphia (PA), pp. 2357-2376.

Algorithms based on ∗-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

Authors
Ivanyos, Gábor
Qiao, Y.
Read more
2014

JOURNAL OF MATHEMATICAL CRYPTOLOGY, 8, pp. 405-416. ISSN 1862-2976

Quantum computation of discrete logarithms in semigroups

Authors
Childs, Andrew M.
Ivanyos, Gábor
Read more
2014

In: 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 Leibniz International Proceedings in Informatics, LIPIcs (25) Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, pp. 397-408.

Generalized Wong sequences and their applications to Edmonds' problems

Authors
Ivanyos, Gábor
Karpisnki, Marek
Qiao, Youming
Santha, Miklos
Editors
Mayr, E W
Portier, N
Read more