Combinatorics of Monotone Computations (1998)

Cached

Download Links

by Stasys Jukna
Venue:Combinatorica
Citations:6 - 0 self

Documents Related by Co-Citation

153 Monotone Circuits for Connectivity Require Superlogarithmic Depth – M Karchmer, A Wigderson - 1988
5 Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes – Jan Johannsen - 1998
214 Many hard examples for resolution – V Chvátal, E Szemerédi - 1988
11 On PHP, st-connectivity and odd charged graphs – P Clote, A Setzer - 1998
181 Short Proofs are Narrow - Resolution made Simple – Eli Ben-sasson, Avi Wigderson - 2000
102 Simplified and Improved Resolution Lower Bounds – Paul Beame, Toniann Pitassi - 1996
19 Unrestricted resolution versus N-resolution – A Goerdt - 1992
4 bounds on sizes of cutting planes proofs for modular coloring principles – Lower - 1998
7 Monotone real circuits are more powerful than monotone boolean circuits – A Rosenbloom - 1997
30 An Exponential Lower Bound for the Size of Monotone Real Circuits – Armin Haken , Stephen Cook - 1995
25 Regular resolution versus unrestricted resolution – Andreas Goerdt - 1993
77 Lower Bounds for Cutting Planes Proofs with Small Coefficients – Maria Luisa Bonet, Toniann Pitassi, Ran Raz - 1995
35 Separation of the Monotone NC Hierarchy – Ran Raz, Pierre McKenzie - 1999
28 Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems – Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi - 1998
86 Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic – Jan Krajícek
330 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
4 Interpolation by a game – J Krajcek - 1997
12 Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic – J Krajcek - 1997
18 Logic for Computer Scientists – U Schöning - 2008