Integer factoring and modular square roots
Author:
- Emil JeřábekEJEmil Jeřábek
- 1 March 2016
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 82 (2) , 380-394
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- GA AV ČR (IAA100190902)
- GA CR (P202/12/G061, RVO: 67985840)
This publication has 9 references indexed in Scilit:
- Propositional proofs and reductions betweensearch problemsAnnals of Pure and Applied Logic, 2012
- Abelian groups and quadratic residues in weak arithmeticMathematical Logic Quarterly, 2010
- On Independence of Variants of the Weak Pigeonhole PrincipleJournal of Logic and Computation, 2007
- PRIMES is in PAnnals of Mathematics, 2004
- The Relative Complexity of NP Search ProblemsJournal of Computer and System Sciences, 1998
- On the complexity of the parity argument and other inefficient proofs of existenceJournal of Computer and System Sciences, 1994
- Combinatorial principles in elementary number theoryAnnals of Pure and Applied Logic, 1991
- Explicit bounds for primality testing and related problemsMathematics of Computation, 1990
- The Least Quadratic Non ResidueAnnals of Mathematics, 1952