Alexander Razborov
Affiliations: | Computer Science | University of Chicago, Chicago, IL |
Area:
Computer Science, Applied MathematicsGoogle:
"Alexander Razborov"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Razborov A. (2016) A new kind of tradeoffs in propositional proof complexity Journal of the Acm. 63 |
| Hatami H, Hladkỳ J, Král D, et al. (2013) On the number of pentagons in triangle-free graphs Journal of Combinatorial Theory. Series A. 120: 722-732 |
| Hatami H, Hladký J, Král' D, et al. (2012) Non-three-colourable common graphs exist Combinatorics Probability and Computing. 21: 734-742 |
| Guruswami V, Lee JR, Razborov A. (2010) Almost Euclidean subspaces of ℓ |
| Razborov A. (2010) Complexity of propositional proofs (Invited talk) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6072: 340-342 |
| Razborov A. (2009) A simple proof of Bazzi's theorem Acm Transactions On Computation Theory. 1 |
| Lifschitz V, Razborov A. (2006) Why are there so many loop formulas? Acm Transactions On Computational Logic. 7: 261-268 |
| Razborov A. (2003) Propositional proof complexity Journal of the Acm. 50: 80-82 |
| Razborov A, Wigderson A, Yao A. (2002) Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus Combinatorica. 22: 555-574 |
| Jukna S, Razborov A, Savický P, et al. (1999) On P versus NP∩CO-NP for decision trees and read-once branching programs Computational Complexity. 8: 357-370 |