共 50 条
- [41] Multiplication Complexity Optimization based on Quantified Boolean Formulas 2024 INTERNATIONAL SYMPOSIUM OF ELECTRONICS DESIGN AUTOMATION, ISEDA 2024, 2024, : 332 - 336
- [42] SAT based BDD solver for Quantified Boolean Formulas ICTAI 2004: 16TH IEEE INTERNATIONALCONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, : 82 - 89
- [43] Partial Witnesses from Preprocessed Quantified Boolean Formulas 2014 DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION (DATE), 2014,
- [44] Comparing different prenexing strategies for quantified Boolean formulas THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2004, 2919 : 214 - 228
- [45] A Duality-Aware Calculus for Quantified Boolean Formulas PROCEEDINGS OF 2016 18TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC), 2016, : 181 - 186
- [46] Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2009, PROCEEDINGS, 2009, 5584 : 391 - +
- [48] Fully dynamic quasi-biclique edge covers via boolean matrix factorizations Miettinen, P. (pauli.miettinen@mpi-inf.mpg.de), 2013, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States
- [49] Clause/term resolution and learning in the evaluation of quantified boolean formulas Journal of Artificial Intelligence Research, 2006, 26 : 371 - 416
- [50] Primal and Dual Encoding from Applications into Quantified Boolean Formulas PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2013, 2013, 8124 : 694 - 707