Login / Signup
Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs.
Fu Li
Iddo Tzameret
Zhengyu Wang
Published in:
Computational Complexity Conference (2015)
Keyphrases
</>
lower bound
upper bound
horn clauses
propositional formulas
predicate calculus
branch and bound algorithm
cnf formula
theorem proving
propositional logic
max sat
theorem prover
first order logic
conjunctive normal form
worst case
objective function
branch and bound
lower and upper bounds
vc dimension
boolean formula
proof procedure
logic programs
upper and lower bounds
multi valued
propositional variables
special case
sample complexity
satisfiability testing
knowledge compilation
normal form
linear programming
np hard
data structure