Login / Signup
Lower Bounds to the Size of Constant-Depth Propositional Proofs.
Jan Krajícek
Published in:
J. Symb. Log. (1994)
Keyphrases
</>
lower bound
constant factor
upper bound
running times
objective function
worst case
depth information
propositional logic
depth map
first order logic
knowledge base
branch and bound algorithm
upper and lower bounds
multi valued
probabilistic logic