María Luisa Bonet | Academic Influence

María Luisa Bonet's AcademicInfluence.com Rankings

María Luisa Bonet

Computer Science

#6037

World Rank

#6366

Historical Rank

Database

#9682

World Rank

#10235

Historical Rank

computer-science Degrees

Download Badge

Computer Science

María Luisa Bonet's Degrees

Bachelors Computer Science University of Barcelona

Similar Degrees You Can Earn

Why Is María Luisa Bonet Influential?

(Suggest an Edit or Addition)

According to Wikipedia, María Luisa Bonet Carbonell is a Spanish computer scientist interested in logic in computer science, including proof complexity and algorithms for the maximum satisfiability problem. She is a professor of computer science at the Polytechnic University of Catalonia.

(See a Problem?)

María Luisa Bonet's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Lower bounds for cutting planes proofs with small coefficients (1995) (190)
SAT-based MaxSAT algorithms (2013) (157)
Solving (Weighted) Partial MaxSAT through Satisfiability Testing (2009) (149)
On Interpolation and Automatization for Frege Systems (2000) (110)
On the automatizability of resolution and related propositional proof systems (2002) (105)
Resolution for Max-SAT (2007) (105)
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (2000) (100)
Non-Automatizability of Bounded-Depth Frege Proofs (1999) (95)
Optimality of size-width tradeoffs for resolution (2002) (82)
A New Algorithm for Weighted Partial MaxSAT (2010) (67)
A study of proof search algorithms for resolution and polynomial calculus (1999) (67)
Are there Hard Examples for Frege Systems (1995) (63)
Measuring the Hardness of SAT Instances (2008) (61)
On the Structure of Industrial SAT Instances (2009) (57)
Approximating Subtree Distances Between Phylogenies (2006) (57)
Towards Industrial-Like Random SAT Instances (2009) (56)
Improving SAT-Based Weighted MaxSAT Solvers (2012) (54)
Size-Depth Tradeoffs for Boolean Fomulae (1994) (49)
The deduction rule and linear and near-linear proof simulations (1993) (48)
A Complete Calculus for Max-SAT (2006) (46)
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution (2002) (45)
Exponential separations between restricted resolution and cutting planes proof systems (1998) (40)
Better methods for solving parsimony and compatibility (1998) (36)
The Fractal Dimension of SAT Formulas (2013) (31)
Improving WPM2 for (Weighted) Partial MaxSAT (2013) (30)
QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS (2016) (29)
No feasible interpolation for TC/sup 0/-Frege proofs (1997) (27)
Efficiently Calculating Evolutionary Tree Measures Using SAT (2009) (27)
On the Complexity of uSPR Distance (2010) (25)
Community Structure in Industrial SAT Instances (2016) (25)
Constructing evolutionary trees in the presence of polymorphic characters (1996) (24)
2-D Tucker is PPA complete (2020) (24)
The Logic Behind Weighted CSP (2007) (23)
MaxSAT Resolution With the Dual Rail Encoding (2018) (22)
Improved Separations of Regular Resolution from Clause Learning Proof Systems (2012) (22)
Structure features for SAT instances classification (2017) (17)
An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning (2012) (13)
On Solving MaxSAT Through SAT (2009) (13)
On the Classification of Industrial SAT Families (2015) (13)
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution (2001) (12)
Short Proofs of the Kneser-Lovász Coloring Principle (2015) (9)
Equivalence Between Systems Stronger Than Resolution (2020) (8)
On Chvatal Rank and Cutting Planes Proofs (2003) (8)
The Complexity of Finding Multiple Solutions to Betweenness and Quartet Compatibility (2011) (6)
Inference Rules for High-Order Consistency in Weighted CSP (2007) (5)
Scale-Free Random SAT Instances (2017) (5)
Linear Lower Bounds and Simulations in Frege Systems with Substitutions (1997) (5)
DRMaxSAT with MaxHS: First Contact (2019) (5)
Analysis and Generation of Pseudo-Industrial MaxSAT Instances (2012) (5)
On the deduction rule and the number of proof lines (1991) (5)
Resolution procedures for multiple-valued optimization (2013) (4)
Propositional proof systems based on maximum satisfiability (2021) (4)
Mapping CSP into Many-Valued SAT (2007) (4)
The Serial Transitive Closure Problem for Trees (1995) (4)
Degree complexity for a modified pigeonhole principle (2003) (3)
What Is a Real-World SAT Instance? (2007) (2)
Trees in the Presence of Polymorphic Characters (1995) (1)
Phase Transition in Realistic Random SAT Models (2019) (1)
A Complete Resolution Calculus for Signed Max-SAT (2007) (1)
Inferring evolutionary trees from polymorphic characters, and an analysis of the Indo-European family of languages (1996) (1)
Proceedings of the Annual IEEE Conference on Computational Complexity: Preface (2005) (1)
Better methods for solving parsimony and compatibility. (1998) (1)
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems (2022) (1)
A I ] 3 J ul 2 01 6 Community Structure in Industrial SAT Instances (2016) (0)
Approximating Subtree Distances Between Phylogenies ☛ ✡ ✟ ✠ AU 1 AU 2 (0)
1994 Annual Meeting of the Association for Symbolic Logic (1995) (0)
Are thereHardExamples for Frege Systems ? (1995) (0)
Inclusive-jet and dijet cross sections in deep inelastic scattering at HERA ZEUS Collaboration (2006) (0)
The Self-Similarity of Industrial SAT Instances (2020) (0)
WITHDRAWN: On Chvátal rank and cutting planes proofs (2004) (0)
Ju l 2 01 9 Scale-Free Random SAT Instances (2018) (0)

This paper list is powered by the following services:

Other Resources About María Luisa Bonet

en.wikipedia.org

What Schools Are Affiliated With María Luisa Bonet?

María Luisa Bonet is affiliated with the following schools: