In computational complexity theory, a natural proof is a certain kind of proof establishing that one complexity class differs from another one. While… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova
- Conference on Computational Complexity
- 2016

Based on Håstad’s (1986) circuit lower bounds, Linial, Mansour, and Nisan (1993) gave a quasipolytime learning algorithm for AC0… (More)

Is this relevant?

2014

2014

- Edgar Pek, Xiaokang Qiu, P. Madhusudan
- PLDI
- 2014

The natural proof technique for heap verification developed by Qiu et al. [32] provides a platform for powerful sound reasoning… (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- Xiaokang Qiu, Pranav Garg, Andrei Stefanescu, P. Madhusudan
- PLDI
- 2013

We propose natural proofs for reasoning with programs that manipulate data-structures against specifications that describe the… (More)

Is this relevant?

2013

2013

- Merlin Carl
- 2013

It is frequently claimed (see e.g. [Rav]) that the formalization of a mathematical proof requires a quality of understanding that… (More)

Is this relevant?

2008

2008

- Timothy Y. Chow
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

Razborov and Rudich have shown that so-called "natural proofs" are not useful for separating P from NP unless hard pseudorandom… (More)

Is this relevant?

1997

1997

- Steven Rudich
- RANDOM
- 1997

We introduce the super-bit conjecture, which allows the development of a theory generalizing the notion of pseudorandomness so as… (More)

Is this relevant?

1995

1995

- Kenneth W. Regan, Dharini Sivakumar, Jin-Yi Cai
- FOCS
- 1995

We prove that if strong pseudorandom number generators exist, then the class of languages that have polynomialsized circuits (P… (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Alexander A. Razborov, Steven Rudich
- STOC
- 1994

We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean… (More)

Is this relevant?

1994

1994

- Alexander A. Razborovy, Steven Rudichz
- 1994

We introduce the notion of natural proof. We argue that the known proofs of lower bounds on the complexity of explicit Boolean… (More)

Is this relevant?

Highly Cited

1977

Highly Cited

1977

- Dexter Kozen
- 18th Annual Symposium on Foundations of Computer…
- 1977

Two decidable logical theories are presented, one complete for deterministic polynomial time, one complete for polynomial space… (More)

Is this relevant?