CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
We consider sets ${\it\Gamma}(n,s,k)$ of narrow clauses expressing that no definition of a size $s$ circ...
Main Author: | JAN KRAJÍČEK |
---|---|
Format: | Article |
Language: | English |
Published: |
Cambridge University Press
2016-01-01
|
Series: | Forum of Mathematics, Sigma |
Subjects: | |
Online Access: | https://www.cambridge.org/core/product/identifier/S205050941600013X/type/journal_article |
Similar Items
-
A feasible interpolation for random resolution
by: Jan Krajicek
Published: (2017-02-01) -
A limitation on the KPT interpolation
by: Jan Krajíček
Published: (2020-08-01) -
Unprovability of circuit upper bounds in Cook's theory PV
by: Jan Krajicek, et al.
Published: (2017-02-01) -
Intuitionistic implication makes model checking hard
by: Martin Mundhenk, et al.
Published: (2012-04-01) -
COMPLEXITY OF SHORT GENERATING FUNCTIONS
by: DANNY NGUYEN, et al.
Published: (2018-01-01)