The following pages link to Maria Luisa Bonet (Q360041):
Displaying 43 items.
- SAT-based MaxSAT algorithms (Q360042) (← links)
- (Q1028941) (redirect page) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- Size-depth tradeoffs for Boolean formulae (Q1318766) (← links)
- Optimality of size-width tradeoffs for resolution (Q1405735) (← links)
- Degree complexity for a modified pigeonhole principle (Q1407601) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Non-automatizability of bounded-depth Frege proofs (Q1764155) (← links)
- Lower bounds for the weak pigeonhole principle and random formulas beyond resolution (Q1854546) (← links)
- On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
- 2-D Tucker is PPA complete (Q2009648) (← links)
- DRMaxSAT with MaxHS: first contact (Q2181935) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Resolution procedures for multiple-valued optimization (Q2510176) (← links)
- Equivalence between systems stronger than resolution (Q2661345) (← links)
- On the relative complexity of resolution refinements and cutting planes proof systems (Q2706120) (← links)
- An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (Q2843321) (← links)
- The deduction rule and linear and near-linear proof simulations (Q3138022) (← links)
- (Q3140632) (← links)
- QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS (Q3188337) (← links)
- The Fractal Dimension of SAT Formulas (Q3192184) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Mapping CSP into Many-Valued SAT (Q3612452) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- (Q4218927) (← links)
- (Q4228474) (← links)
- (Q4234107) (← links)
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters (Q4268873) (← links)
- The Serial Transitive Closure Problem for Trees (Q4326856) (← links)
- Lower bounds for cutting planes proofs with small coefficients (Q4372903) (← links)
- (Q4375729) (← links)
- (Q4411848) (← links)
- On Interpolation and Automatization for Frege Systems (Q4507332) (← links)
- (Q4535079) (← links)
- (Q4850545) (← links)
- Community Structure in Industrial SAT Instances (Q5235475) (← links)
- Improved Separations of Regular Resolution from Clause Learning Proof Systems (Q5415765) (← links)
- A Complete Calculus for Max-SAT (Q5756577) (← links)
- Scale-Free Random SAT Instances (Q6290396) (← links)
- Polynomial calculus for MaxSAT (Q6643077) (← links)
- On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (Q6649455) (← links)
- Polynomial calculus for optimization (Q6665696) (← links)
