Resolution proofs, exponential bounds, and kolmogorov complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1295, Issue , 1997, Pages 110-116

  Schöning, Uwe ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EXPANDER GRAPHS; EXPONENTIAL BOUNDS; KOLMOGOROV COMPLEXITY; LOWER BOUNDS; RESOLUTION PROOFS;

COMPUTATIONAL COMPLEXITY;

EID: 0002244011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0029954     Document Type: Conference Paper

References (14)

1. P. Beame, T. Pitassi. Simplified and improved resolution lower bounds. Proc. 37th IEEE Sympos. Foundations of Computer Science 1996
2. S. Cook, T. Pitassi. A feasible constructive lower bound proof for resolution proofs. In]ormation Processing Letters 34 (1990) 81-85
3. F.R.K. Chung. Constructing random-like graphs. In: B. Bollobs (ed.): Probabilistic Combinatorics and Applications, Proceedings of Symposia in Applied Mathematics, Vol. 44, pp. 21-55. American Math. Society, 1991
4. V. Chvátal, E. Szemerödi. Many hard examples for resolution. Journal of the Assoc. for Comput. Mach. 35 (1988) 759-768
5. A. ttaken. The intractability of resolution. Theoretical Computer Science 39 (1985) 297-308
6. M. Li, P. Vitanyi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 1993
7. M. Paterson. Improved sorting networks with O(log n) depth. Algorithmiea, to appear
8. M. Pinsker. On the complexity of a concentrator. 7th Int. Teletraffic Conference. 1973, 318/1-318/4
9. N. Pippenger. Superconcentrators. SIAM J. Comput. 6 (1977) 298-304
10. U. Schöning. Better expanders and superconcentrators by Kolmogorov complexity. 4th International Colloq. on Structural Information and Communication Complexity, 1997
11. M. Sipser, D.A. Spielman. Expander codes. Proc. 35th IEEE Sympos. Foundations of Computer Science, 566-576, 1994
12. G.S. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968. Reprinted in Siekmann, WTrightson: Automization of Reasoning, Springer-Verlag, 1983
13. A. Urquhart. Hard examples for resolution. Journal of the Assoc. Comput. Mach. 34 (1987) 209-219
14. D. Welsh. Codes and Cryptography. Oxford University Press, 1988.