Pages that link to "Item:Q4372917"
From MaRDI portal
The following pages link to Lower bounds for resolution and cutting plane proofs and monotone computations (Q4372917):
Displaying 50 items.
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs (Q286731) (← links)
- Proof tree preserving tree interpolation (Q286737) (← links)
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes (Q293309) (← links)
- Lower bounds for monotone counting circuits (Q313809) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418) (← links)
- Cutting planes cannot approximate some integer programs (Q453048) (← links)
- Benchmarking a model checker for algorithmic improvements and tuning for performance (Q453484) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- Resolution proof transformation for compression and interpolation (Q479815) (← links)
- How to deal with unbelievable assertions (Q524943) (← links)
- Constraint solving for interpolation (Q604394) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Efficient generation of small interpolants in CNF (Q746773) (← links)
- Interpolation and model checking for nonlinear arithmetic (Q832268) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Classes of representable disjoint \textsf{NP}-pairs (Q884465) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Efficient Craig interpolation for linear Diophantine (dis)equations and linear modular equations (Q1039847) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- No feasible monotone interpolation for simple combinatorial reasoning (Q1575265) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A note on monotone real circuits (Q1685020) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- Exploiting partial variable assignment in interpolation-based model checking (Q2009611) (← links)
- Proof complexity of substructural logics (Q2032997) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- On the lengths of tree-like and dag-like cutting plane refutations of Horn constraint systems. Horn constraint systems and cutting plane refutations (Q2095546) (← links)
- How QBF expansion makes strategy extraction hard (Q2096438) (← links)
- Interpolation and amalgamation for arrays with MaxDiff (Q2233410) (← links)
- Farkas-based tree interpolation (Q2233543) (← links)
- Copy complexity of Horn formulas with respect to unit read-once resolution (Q2235734) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution (Q2255289) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- NIL: learning nonlinear interpolants (Q2305413) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
