Person:360041

Available identifiers

zbMath Open bonet.maria-luisaDBLP20/2857WikidataQ51545286 ScholiaQ51545286MaRDI QIDQ360041

List of research outcomes

Publication	Date of Publication	Type
Propositional proof systems based on maximum satisfiability	2021-11-02	Paper
Equivalence between systems stronger than resolution	2021-04-07	Paper
DRMaxSAT with MaxHS: first contact	2020-05-20	Paper
2-D Tucker is PPA complete	2019-11-29	Paper
Community Structure in Industrial SAT Instances	2019-10-11	Paper
Short proofs of the Kneser-Lovász coloring principle	2018-06-14	Paper
Scale-Free Random SAT Instances	2017-07-12	Paper
QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS	2016-08-19	Paper
Short Proofs of the Kneser-Lovász Coloring Principle	2015-11-04	Paper
The Fractal Dimension of SAT Formulas	2014-09-26	Paper
Resolution procedures for multiple-valued optimization	2014-08-01	Paper
Improved Separations of Regular Resolution from Clause Learning Proof Systems	2014-05-16	Paper
SAT-based MaxSAT algorithms	2013-08-23	Paper
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning	2013-08-12	Paper
Resolution for Max-SAT	2009-07-09	Paper
Efficiently Calculating Evolutionary Tree Measures Using SAT	2009-07-07	Paper
Solving (Weighted) Partial MaxSAT through Satisfiability Testing	2009-07-07	Paper
Mapping CSP into Many-Valued SAT	2009-03-10	Paper
A Complete Calculus for Max-SAT	2007-09-04	Paper
Non-automatizability of bounded-depth Frege proofs	2005-02-23	Paper
On the automatizability of resolution and related propositional proof systems	2004-10-04	Paper
Degree complexity for a modified pigeonhole principle	2003-09-16	Paper
Optimality of size-width tradeoffs for resolution	2003-08-26	Paper
https://portal.mardi4nfdi.de/entity/Q4411848	2003-07-10	Paper
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4535079	2002-06-12	Paper
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems	2001-03-19	Paper
On Interpolation and Automatization for Frege Systems	2000-10-18	Paper
https://portal.mardi4nfdi.de/entity/Q4228474	2000-05-28	Paper
Constructing Evolutionary Trees in the Presence of Polymorphic Characters	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4234107	1999-09-07	Paper
https://portal.mardi4nfdi.de/entity/Q4375729	1998-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q4218927	1998-11-15	Paper
Lower bounds for cutting planes proofs with small coefficients	1998-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4850545	1995-10-17	Paper
The Serial Transitive Closure Problem for Trees	1995-03-27	Paper
Size-depth tradeoffs for Boolean formulae	1994-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q3140632	1993-11-28	Paper
The deduction rule and linear and near-linear proof simulations	1993-10-24	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Maria Luisa Bonet