Some consequences of cryptographical conjectures for S21 and EF

Information and Computation

Volumn 140, Issue 1, 1998, Pages 82-94

  Krajíček, Jan ^a   Pudlák, Pavel ^a  

^a MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001978209     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2674     Document Type: Article

References (30)

1. Alexi W. B., Chor, B., Goldreich, O., and Schnorr C. P. (1988), RSA and Rabin functions: Certain parts are as hard as the whole, SIAM J. Comp. 17, 194-209.
2. Bonet, M. L., Pitassi, T., and Raz, R. (1997), Lower bounds for cutting planes proofs with small coefficients, J. Symbolic Logic 62(3), 708-728.
3. Buss, S. R. (1986), "Bounded Arithmetic," Bibliopolis, Naples .
4. Clegg, M., Edmonds, J., and Implagliazzo, R. (1996), Using the Groebner basis algorithm to find proofs of unsatisfiability, in "Proc. the 28th Annual ACM Symposium on Theory of Computing," pp. 174-183, Assoc. Comput. Mach., New York.
5. Cook, S. A. (1975), Feasibly constructive proofs and the propositional calculus, in "Proc. 7th Annual ACM Symposium on Theory of Computing," pp. 83-97, Assoc. Comput. Mach., New York.
6. Cook, S. A., and Reckhow, A. R. (1979), The relative efficiency of propositional proof systems, J. Symbolic Logic 44(1), -50.
7. Krajíček, J. (1993), Fragments of bounded arithmetic and bounded query classes, Trans. Amer. Math. Soc. 338(2), 587-598.
8. Krajíček, J. (1994), Lower bounds to the size of constant-depth propositional proofs, J. Symbolic Logic 59(1), 73-86.
9. Krajíček, J. (1995), Bounded arithmetic, propositional logic and complexity theory, in "Encyclopedia of Mathematics and Its Applications," Vol. 60, Cambridge Univ. Press, Cambridge, UK/New York/Melbourne.
10. Krajíček, J. (1997), Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic, J. Symbolic Logic 62(2), 457-486.
11. Krajíček, J., Discretely ordered modules as a first-order extension of the cutting planes proof system, J. Symbolic Logic, to appear.
12. Krajíček, J., Interpolation by a game, Math. Logic Quart., to appear.
13. Krajíček, J. ((995), On methods for proving lower bounds in propositional logic, in "The Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence (August 19-25)" (M. L. Dalla Chiara, K. Dotes, D. Mundici, and J. van Benthem, Eds.), Vol. 1 (Logic and Scientific Methods), pp. 69-83, Kluwer Academic, Dordrecht.
14. Krajíček, J., and Pudlák, P. (1989), Propositional proof systems, the consistency of first order theories and the complexity of computations, J. Symbolic Logic 54(3), 1063-1079.
15. Krajíček, J. (1990), Quantified propositional calculi and fragments of bounded arithmetic, Z. Math. Logik Grundlagen Math. 36(1), 29-46.
16. Krajíček, J., Pudlák, P., and Takeuti, G. (1991), Bounded arithmetic and the polynomial hierarchy, Ann. Pure Appl. Logic 52, -153.
17. Mundici, D. (1982), Complexity of Craig's interpolation, Fund. Inform. 5, 261-278.
18. Mundici, D. (1983), A lower bound for the complexity of Craig's interpolants in sentential logic, Arch. Math. Logik 23, 27-36.
19. Mundici, D. (1984), Tautologies with a unique Craig interpolant, uniform vs. non-uniform complexity, Ann. Pure Appl. Logic 27, 265-273.
20. Mundici, D. (1984), NP and Craig's interpolation theorem, "Proc. Logic Colloquium 1982," pp. 345-358, North-Holland, Amsterdam.
21. Papadimitriou, A. (1994), "Computational Complexity," Addison-Wesley, Reading, MA.
22. Paris, J., and Wilkie, A. (1985), Counting problems in bounded arithmetic, in "Methods in Mathematical Logic," Lecture Notes in Mathematics, Vol. 1130, pp. 317-340, Springer-Verlag, Berlin/New York.
23. Paris, J. B., Wilkie, A. J., and Woods, A. R. (1988), Probability of the pigeonhole principle and the existence of infinitely many primes, J. Symbolic Logic 53, 1235-1244.
24. Pratt, V. R. (1975), Every prime has a succinct certificate, SIAM J. Comput. 4, 214-220.
25. Pudlák, P. (1997), Lower bounds for resolution and cutting planes proofs and monotone computations, J. Symbolic Logic 62(3), 981-998.
26. Pudlák, P., and Sgall, J. (1996), Algebraic models of computation, and interpolation for algebraic proof systems, submitted.
27. Razborov, A. A. (1995), Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izv. Ross. Akad. Nauk 59(1), 201-224.
28. Razborov, A. A. (1994), On provably disjoint NP-pairs, Basic Research in Computer Science Center, RS-94-36, Aarhus, preprint.
29. Rivest, M., Shamir, A., and Adleman, L. (1978), A method of obtaining digital signatures and public-key cryptosystems. ACM Comm. 21, 120-126.
30. Takeuti, G. (1992), RSUV isomorphism, in "Arithmetic, Proof Theory and Computational Complexity" (Clote and Krajíček, Eds.), pp. 364-386, Oxford Univ. Press, Oxford.