Search the dblp DataBase
Maria Luisa Bonet :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Maria Luisa Bonet , Carlos Domingo , Ricard Gavaldà , Alexis Maciel , Toniann Pitassi Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 1999, pp:15-23 [Conf ] Albert Atserias , Maria Luisa Bonet On the Automatizability of Resolution and Related Propositional Proof Systems. [Citation Graph (0, 0)][DBLP ] CSL, 2002, pp:569-583 [Conf ] Maria Luisa Bonet , Nicola Galesi Linear Lower Bounds and Simulations in Frege Systems with Substitutions. [Citation Graph (0, 0)][DBLP ] CSL, 1997, pp:115-128 [Conf ] Maria Luisa Bonet , Juan Luis Esteban , Nicola Galesi , Jan Johannsen Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:638-647 [Conf ] Maria Luisa Bonet , Nicola Galesi A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:422-432 [Conf ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz No Feasible Interpolation for TC0-Frege Proofs. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:254-263 [Conf ] Albert Atserias , Maria Luisa Bonet , Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution. [Citation Graph (0, 0)][DBLP ] ICALP, 2001, pp:1005-1016 [Conf ] Carlos Ansótegui , Maria Luisa Bonet , Jordi Levy , Felip Manyà The Logic Behind Weighted CSP. [Citation Graph (0, 0)][DBLP ] IJCAI, 2007, pp:32-37 [Conf ] Maria Luisa Bonet , Samuel R. Buss On the Deduction Rule and the Number of Proof Lines [Citation Graph (0, 0)][DBLP ] LICS, 1991, pp:286-297 [Conf ] Maria Luisa Bonet , Mike A. Steel , Tandy Warnow , Shibu Yooseph Better methods for solving parsimony and compatibility. [Citation Graph (0, 0)][DBLP ] RECOMB, 1998, pp:40-49 [Conf ] Maria Luisa Bonet , Jordi Levy , Felip Manyà A Complete Calculus for Max-SAT. [Citation Graph (0, 0)][DBLP ] SAT, 2006, pp:240-251 [Conf ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz Lower bounds for cutting planes proofs with small coefficients. [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:575-584 [Conf ] Maria Luisa Bonet , Cynthia A. Phillips , Tandy Warnow , Shibu Yooseph Constructing Evolutionary Trees in the Presence of Polymorphic Characters. [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:220-229 [Conf ] Maria Luisa Bonet , Nicola Galesi Degree complexity for a modified pigeonhole principle. [Citation Graph (0, 0)][DBLP ] Arch. Math. Log., 2003, v:42, n:5, pp:403-414 [Journal ] Maria Luisa Bonet , Carlos Domingo , Ricard Gavaldà , Alexis Maciel , Toniann Pitassi Non-Automatizability of Bounded-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 2004, v:13, n:1-2, pp:47-68 [Journal ] Maria Luisa Bonet , Nicola Galesi Optimality of size-width tradeoffs for resolution. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 2001, v:10, n:4, pp:261-276 [Journal ] Albert Atserias , Maria Luisa Bonet On the Automatizability of Resolution and Related Propositional Proof Systems [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:010, pp:- [Journal ] Albert Atserias , Maria Luisa Bonet , Jordi Levy On Chvatal Rank and Cutting Planes Proofs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:041, pp:- [Journal ] Maria Luisa Bonet , Juan Luis Esteban , Nicola Galesi , Jan Johannsen Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:35, pp:- [Journal ] Albert Atserias , Maria Luisa Bonet On the automatizability of resolution and related propositional proof systems. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2004, v:189, n:2, pp:182-201 [Journal ] Albert Atserias , Maria Luisa Bonet , Juan Luis Esteban Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:176, n:2, pp:136-152 [Journal ] Maria Luisa Bonet , Samuel R. Buss Size-Depth Tradeoffs for Boolean Fomulae. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:49, n:3, pp:151-155 [Journal ] Maria Luisa Bonet , Mike A. Steel , Tandy Warnow , Shibu Yooseph Better Methods for Solving Parsimony and Compatibility. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 1998, v:5, n:3, pp:391-408 [Journal ] Maria Luisa Bonet , Samuel R. Buss The Deduction Rule and Linear and Near-Linear Proof Simulations. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1993, v:58, n:2, pp:688-709 [Journal ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz Lower Bounds for Cutting Planes Proofs with Small Coefficients. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1997, v:62, n:3, pp:708-728 [Journal ] Maria Luisa Bonet , Samuel R. Buss The Serial Transitive Closure Problem for Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:1, pp:109-122 [Journal ] Maria Luisa Bonet , Juan Luis Esteban , Nicola Galesi , Jan Johannsen On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:30, n:5, pp:1462-1484 [Journal ] Maria Luisa Bonet , Toniann Pitassi , Ran Raz On Interpolation and Automatization for Frege Systems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2000, v:29, n:6, pp:1939-1967 [Journal ] Maria Luisa Bonet , Cynthia A. Phillips , Tandy Warnow , Shibu Yooseph Constructing Evolutionary Trees in the Presence of Polymorphic Characters. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1999, v:29, n:1, pp:103-131 [Journal ] Carlos Ansótegui , Maria Luisa Bonet , Jordi Levy , Felip Manyà Inference Rules for High-Order Consistency in Weighted CSP. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:167-172 [Conf ] Carlos Ansótegui , Maria Luisa Bonet , Jordi Levy , Felip Manyà Mapping CSP into Many-Valued SAT. [Citation Graph (0, 0)][DBLP ] SAT, 2007, pp:10-15 [Conf ] Maria Luisa Bonet , Jordi Levy , Felip Manyà Resolution for Max-SAT. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2007, v:171, n:8-9, pp:606-618 [Journal ] Measuring the Hardness of SAT Instances. [Citation Graph (, )][DBLP ] A New Algorithm for Weighted Partial MaxSAT. [Citation Graph (, )][DBLP ] What Is a Real-World SAT Instance? [Citation Graph (, )][DBLP ] Random SAT Instances à la Carte. [Citation Graph (, )][DBLP ] On Solving MaxSAT Through SAT. [Citation Graph (, )][DBLP ] On the Structure of Industrial SAT Instances. [Citation Graph (, )][DBLP ] Towards Industrial-Like Random SAT Instances. [Citation Graph (, )][DBLP ] A Complete Resolution Calculus for Signed Max-SAT. [Citation Graph (, )][DBLP ] Efficiently Calculating Evolutionary Tree Measures Using SAT. [Citation Graph (, )][DBLP ] Solving (Weighted) Partial MaxSAT through Satisfiability Testing. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.303secs