Counting Bottlenecks to Show Monotone P <=> NP

@inproceedings{Haken1995CountingBT,
  title={Counting Bottlenecks to Show Monotone P <=> NP},
  author={Armin Haken},
  booktitle={FOCS},
  year={1995}
}
BETA

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 26 CITATIONS

On the bottleneck counting argument

  • Theor. Comput. Sci.
  • 2000
VIEW 17 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

OF MONOTONE COMPUTATIONS

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

The Potential of the Approximation Method 1

Kazuyuki Amano, Akira, MaruokaGraduate
  • 1996
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Average Case Lower Bounds for Monotone Switching Networks

  • 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

Just a Pebble Game

  • 2013 IEEE Conference on Computational Complexity
  • 2013
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…