Publikációk

2003

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 14 (5)., pp. 723-739.

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

Szerzők

Ivanyos, Gábor

Magniez, F.

Santha, M.

2010

SIAM Journal on Computing, 39 (8)., pp. 3736-3751.

Deterministic polynomial time algorithms for matrix completion problems

Szerzők

Ivanyos, Gábor

Karpinski, Marek

Saxena, Nitin

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

Szerzők

Ivanyos, Gábor

Kulkarni, R

Qiao, YM

Santha, M

Sundaram, A

1996

In: Proceeding of the seventh ACM-SIAM symposium on discrete algorithms. Atlanta, 1996..

Multiplicative equations over commuting matrices

Szerzők

Babai, L.

Beals, R.

Cai, J-Y

Ivanyos, Gábor

Luks, EM

1997

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 8, pp. 291-304.

Computing Levi decompositions in Lie algebras

Szerzők

De Graaf, W.

Ivanyos, Gábor

Küronya, A.

2006

Journal of Algebra, 300 (2)., pp. 433-454.

Root filtration spaces from Lie algebras and abstract root groups

Szerzők

Cohen, AM

Ivanyos, Gábor

2014

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

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems

Szerzők

Decker, Thomas

Høyer, Peter

Ivanyos, Gábor

Santha, Miklos

2018

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

Chevalley-Warning Theorem in Quantum Computing

Szerzők

Ivanyos, Gábor

2000

In: ISSAC 2000. International symposium on symbolic and algebraic computation. St. Andrews, 2000..

Fast randomized algorithms for the structure of matrix algebras over finite fields

Szerzők

Ivanyos, Gábor

2007

In: STACS 2007. (Lecture notes in computer science 4393.).

An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups

Szerzők

Ivanyos, Gábor

Sanselme, Luc

Santha, Miklos

Szerkesztők

Weil, W. T.