The following pages link to Gábor Ivanyos (Q220632):
Displaying 15 items.
- Irreducibility and Deterministic r-th Root Finding over Finite Fields (Q5119920) (← links)
- On the Complexity of Trial and Error for Constraint Satisfaction Problems (Q5167781) (← links)
- Deterministic polynomial factoring and association schemes (Q5170254) (← links)
- Deterministic Polynomial Time Algorithms for Matrix Completion Problems (Q5390613) (← links)
- Hidden Symmetry Subgroup Problems (Q5396953) (← links)
- Hidden Translation and Translating Coset in Quantum Computing (Q5419027) (← links)
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups (Q5458577) (← links)
- Fundamentals of Computation Theory (Q5492932) (← links)
- EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM (Q5696935) (← links)
- Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals (Q5951487) (← links)
- (Q6126328) (← links)
- (Q6176155) (← links)
- On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions (Q6538693) (← links)
- Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH (Q6595808) (← links)
- Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem (Q6618613) (← links)
