Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate
Bulletin of Symbolic Logic 8 (2):301-302 (2002)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesMichael Alekhnovich, Sam Buss, Shlomo Moran & Toniann Pitassi (2001). Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. Journal of Symbolic Logic 66 (1):171-191.
Maria Luisa Bonet & Samuel R. Buss (1993). The Deduction Rule and Linear and Near-Linear Proof Simulations. Journal of Symbolic Logic 58 (2):688-709.
Jan Krajíček & Pavel Pudlák (1989). Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. Journal of Symbolic Logic 54 (3):1063-1079.
Joshua Buresh-Oppenheim & Toniann Pitassi (2007). The Complexity of Resolution Refinements. Journal of Symbolic Logic 72 (4):1336-1352.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
Jan Krajíček (2004). Dual Weak Pigeonhole Principle, Pseudo-Surjective Functions, and Provability of Circuit Lower Bounds. Journal of Symbolic Logic 69 (1):265 - 286.
Claes Strannegård, Simon Ulfsbäcker, David Hedqvist & Tommy Gärling (2010). Reasoning Processes in Propositional Logic. Journal of Logic, Language and Information 19 (3).
Samuel R. Buss (1987). Polynomial Size Proofs of the Propositional Pigeonhole Principle. Journal of Symbolic Logic 52 (4):916-927.
Samuel R. Buss (1994). On Gödel's Theorems on Lengths of Proofs I: Number of Lines and Speedup for Arithmetics. Journal of Symbolic Logic 59 (3):737-756.
Nathan Segerlind (2007). The Complexity of Propositional Proofs. Bulletin of Symbolic Logic 13 (4):417-481.
Charles R. Twardy (2011). Local Complexity Adaptable Trajectory Partitioning Via Minimum Message Length. In 18th IEEE International Conference on Image Processing. IEEE.
Marta Bílková (2007). Uniform Interpolation and Propositional Quantifiers in Modal Logics. Studia Logica 85 (1):1 - 31.
Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller (2011). Strong Isomorphism Reductions in Complexity Theory. Journal of Symbolic Logic 76 (4):1381-1402.
Michael Möllerfeld (2002). Review: Michael Rathjen, Samuel R. Buss, Petr Hájek, Pavel Pudlák, The Superjump in Martin-Löf Type Theory. [REVIEW] Bulletin of Symbolic Logic 8 (4):538-538.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-30Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
