Maria Luisa Bonet
Maria Luisa Bonet
LSI, UPC
Dirección de correo verificada de lsi.upc.edu - Página principal
TítuloCitado porAño
Lower bounds for cutting planes proofs with small coefficients
M Bonet, T Pitassi, R Raz
The Journal of Symbolic Logic 62 (3), 708-728, 1997
1641997
Solving (weighted) partial MaxSAT through satisfiability testing
C Ansótegui, ML Bonet, J Levy
International conference on theory and applications of satisfiability …, 2009
1402009
SAT-based MaxSAT algorithms
C Ansótegui, ML Bonet, J Levy
Artificial Intelligence 196, 77-105, 2013
1112013
On interpolation and automatization for Frege systems
ML Bonet, T Pitassi, R Raz
SIAM Journal on Computing 29 (6), 1939-1967, 2000
1072000
On the relative complexity of resolution refinements and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
SIAM Journal on Computing 30 (5), 1462-1484, 2000
942000
Resolution for max-sat
ML Bonet, J Levy, F Manyà
Artificial Intelligence 171 (8-9), 606-618, 2007
882007
Optimality of size-width tradeoffs for resolution
ML Bonet, N Galesi
Computational Complexity 10 (4), 261-276, 2001
862001
A study of proof search algorithms for resolution and polynomial calculus
ML Bonet, N Galesi
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
721999
A new algorithm for weighted partial MaxSAT
C Ansótegui, ML Bonet, J Levy
Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010
652010
Approximating subtree distances between phylogenies
ML Bonet, KS John, R Mahindru, N Amenta
Journal of Computational Biology 13 (8), 1419-1434, 2006
542006
On the automatizability of resolution and related propositional proof systems
A Atserias, ML Bonet
Information and Computation 189 (2), 182-201, 2004
542004
Are there hard examples for Frege systems?
ML Bonet, SR Buss, T Pitassi
Feasible Mathematics II, 30-56, 1995
541995
Size-depth tradeoffs for Boolean formulae
ML Bonet, SR Buss
Information Processing Letters 49 (3), 151-155, 1994
491994
Measuring the Hardness of SAT Instances.
C Ansótegui, ML Bonet, J Levy, F Manya
AAAI 8, 222-228, 2008
472008
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
A Atserias, ML Bonet, JL Esteban
Information and Computation 176 (2), 136-152, 2002
462002
Exponential separations between restricted resolution and cutting planes proof systems
ML Bonet, JL Esteban, N Galesi, J Johannsen
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
451998
Better methods for solving parsimony and compatibility
M Bonet, M Steel, T Warnow, S Yooseph
Journal of Computational Biology 5 (3), 391-407, 1998
451998
Non-automatizability of bounded-depth Frege proofs
ML Bonet, C Domingo, R Gavalda, A Maciel, T Pitassi
computational complexity 13 (1-2), 47-68, 2004
422004
On the structure of industrial SAT instances
C Ansótegui, ML Bonet, J Levy
International Conference on Principles and Practice of Constraint …, 2009
412009
Towards industrial-like random SAT instances
C Ansótegui, ML Bonet, J Levy
Twenty-First International Joint Conference on Artificial Intelligence, 2009
402009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20