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