The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for QSAT with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1999-2009 (16) 2010-2022 (17)
Publication types (Num. hits)
article(13) inproceedings(20)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 14 keywords

Results
Found 33 publication records. Showing 33 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
75Mohammad Ghasemzadeh 0001, Volker Klotz, Christoph Meinel Embedding Memoization to the Semantic Tree Search for Deciding QBFs. Search on Bibsonomy Australian Conference on Artificial Intelligence The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Zero-Suppressed Binary Decision Diagram (ZDD), Quantified Boolean Formula (QBF), QSAT, Satisfiability, DPLL
73Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol (1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
64Andris Ambainis, Julia Kempe, Or Sattath A quantum lovász local lemma. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF local lemma, quanum SAT, random quantum sat, quantum computation, probabilistic method
64Abdesslem Layeb, Djamel-Eddine Saïdouni A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem. Search on Bibsonomy HAIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
64K. Subramani 0001 Tractable Fragments of Presburger Arithmetic. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
64K. Subramani 0001 Analyzing Selected Quantified Integer Programs. Search on Bibsonomy IJCAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
52Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Francisco José Romero-Campero A Linear Solution for QSAT with Membrane Creation. Search on Bibsonomy Workshop on Membrane Computing The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
42Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol New Results on the Phase Transition for Random Quantified Boolean Formulas. Search on Bibsonomy SAT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Marcin Rychlik On Probabilistic Quantified Satisfability Games. Search on Bibsonomy MFCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33T. V. Thirumala Reddy, D. Sai Krishna, C. Pandu Rangan The Guarding Problem - Complexity and Approximation. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF QBF (Quantified Boolean Formula), QSAT (Quantified Satisfiability), Approximation Algorithms, PSPACE-complete
30David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez P systems with evolutional symport and membrane creation rules solving QSAT. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez Membrane creation and symport/antiport rules solving QSAT. Search on Bibsonomy J. Membr. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Ruiyang Xu, Karl J. Lieberherr Towards Tackling QSAT Problems with Deep Learning and Monte Carlo Tree Search. Search on Bibsonomy SAI (2) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
30Sean B. Holden Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT. Search on Bibsonomy Found. Trends Mach. Learn. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
30Ruiyang Xu, Karl J. Lieberherr Solving QSAT problems with neural MCTS. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
30David E. Narváez A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract). Search on Bibsonomy AAAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
30Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron Solving QSAT in sublinear depth. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
30Andreas Goerdt Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. Search on Bibsonomy CSR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
30Alberto Leporati, Luca Manzoni, Giancarlo Mauri, Antonio E. Porreca, Claudio Zandron Solving QSAT in Sublinear Depth. Search on Bibsonomy Int. Conf. on Membrane Computing The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
30Bosheng Song, Mario J. Pérez-Jiménez, Linqiang Pan An efficient time-free solution to QSAT problem using P systems with proteins on membranes. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
30Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
30Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere Clause Elimination for SAT and QSAT. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
30Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol Exact location of the phase transition for random (1, 2)-QSAT. Search on Bibsonomy RAIRO Theor. Informatics Appl. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
30Nadia Creignou, Uwe Egly, Martina Seidl A Framework for the Specification of Random SAT and QSAT Formulas. Search on Bibsonomy TAP@TOOLS The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
30Minghao Yin Worst-Case Upper Bound for (1, 2)-QSAT Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
30Tseren-Onolt Ishdorj, Alberto Leporati, Linqiang Pan, Xiangxiang Zeng, Xingyi Zhang 0001 Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
30Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol The threshold for random (1,2)-QSAT Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
30Ian P. Gent, Toby Walsh Beyond NP: the QSAT phase transition. Search on Bibsonomy AAAI/IAAI The full citation details ... 1999 DBLP  BibTeX  RDF
21Padmalochan Bera, Soumya Kanti Ghosh 0001, Pallab Dasgupta Formal Verification of Security Policy Implementations in Enterprise Networks. Search on Bibsonomy ICISS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Access control list (ACL), Formal Verification, Network security, Security Policy
21Khaled Dridi, Nadeem Javaid, Boubaker Daachi, Karim Djouani IEEE 802.11e-EDCF evaluation through MAC-layer metrics over QoS-aware mobility constraints. Search on Bibsonomy MoMM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF EDCF, end-2-end delay, QoS, mobility, throughput, jitter, IEEE 802.11e
21Artiom Alhazov, Mario J. Pérez-Jiménez Uniform Solution of. Search on Bibsonomy MCU The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
21Thomas Sturm 0001 Quantifier Elimination for Constraint Logic Programming. Search on Bibsonomy CASC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
21Ryan Williams 0001 Algorithms for quantified Boolean formulas. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
Displaying result #1 - #33 of 33 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license