M. L. Bonet

On the automatizability of resolution and related propositional proof systems

Maria Luisa Bonet, Albert Atserias, Albert Atserias, 2002, Inf. Comput..

Scale-Free Random SAT Instances

M. L. Bonet, C. Ansótegui, Jordi Levy, 2017 .

Approximating Subtree Distances Between Phylogenies ☛ ✡ ✟ ✠ AU 1 AU 2

Maria Luisa Bonet, N. Amenta, R. Mahindru, 2022 .

A I ] 3 J ul 2 01 6 Community Structure in Industrial SAT Instances

Maria Luisa Bonet, M. L. Bonet, C. Ansótegui, 2016 .

Non-Automatizability of Bounded-Depth Frege Proofs

Toniann Pitassi, Carlos Domingo, Maria Luisa Bonet, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Are thereHardExamples for Frege Systems ?

Maria Luisa Bonet, M. L. Bonet, 1995 .

Trees in the Presence of Polymorphic Characters

Maria Luisa Bonet, S. Yooseph, T. Warnow, 1995 .