Combinatorics of Monotone Computations (1998)

Cached

Download Links

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

Active Bibliography

COMBINATORICA Bolyai Society – Springer-Verlag COMBINATORICA 19 (1) (1999) 65–85 COMBINATORICS OF MONOTONE COMPUTATIONS STASYS JUKNA* – unknown authors - 1996
5 Finite Limits and Monotone Computations: The Lower Bounds Criterion – Stasys Jukna - 1997
34 Separation of the Monotone NC Hierarchy – Ran Raz, Pierre McKenzie - 1999
5 A Criterion for Monotone Circuit Complexity – Stasys Jukna - 1991
5 Higher Lower Bounds On Monotone Size – Danny Harnik, Ran Raz - 2000
2331 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
2 Monotone Complexity by Switching Lemma – Danny Harnik, Ran Raz
8 On the Bottleneck Counting Argument – Janos Simon, Shi-chun Tsai - 1997
50 The History and Status of the P versus NP Question – Michael Sipser, Juris Hartmanis - 1992
10 The Fusion Method for Lower Bounds in Circuit Complexity – Avi Wigderson - 1993
30 An Exponential Lower Bound for the Size of Monotone Real Circuits – Armin Haken , Stephen Cook - 1995
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
75 Monotone Circuits for Matching Require Linear Depth – Ran Raz , Avi Wigderson
1 Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean Circuits – Rimli Sengupta, H. Venkateswaran
14 Discretely Ordered Modules as a First-Order Extension of the Cutting Planes Proof System – Jan Krajícek
10 Disjoint NP-Pairs and . . . – Olaf Beyersdorff
101 On the power of small-depth threshold circuits – Johan Hastad, Mikael Goldmann - 1990
10 Characterizing non-deterministic circuit size – Mauricio Karchmer, Avi Wigderson - 1993
11 Symmetric Approximation Arguments for Monotone Lower Bounds without Sunflowers – Christer Berg, Staffan Ulfberg - 1997