# Consistency of circuit evaluation , extended resolution and total NP search problems

@inproceedings{Krajek2016ConsistencyOC,
title={Consistency of circuit evaluation , extended resolution and total NP search problems},
author={Jan Kraj́ı{\vc}ek},
year={2016}
}
• Jan Kraj́ıček
• Published 2016
We consider sets Γ(n, s, k) of narrow clauses expressing that no definition of a size s circuit with n inputs is refutable in resolution R in k steps. We show that every CNF with a short refutation in Extended R, ER, can be easily reduced to an instance of Γ(0, s, k) (with s, k depending on the size of the ER-refutation) and, in particular, that Γ(0, s, k) when interpreted as a relativized NP search problem is complete among all such problems provably total in bounded arithmetic theory V 1 1… CONTINUE READING

#### Citations

##### Publications citing this paper.
Highly Influenced
4 Excerpts

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES
Highly Influential
6 Excerpts
Highly Influential
2 Excerpts

## Logical foundations of proof complexity

• S. A. Cook, P. Nguyen
• (ASL Perspectives in Logic Series, Cambridge…
• 2014
3 Excerpts
1 Excerpt
1 Excerpt

#### Similar Papers

Loading similar papers…