default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2005
- Holger H. Hoos, David G. Mitchell:
Theory and Applications of Satisfiability Testing, 7th International Conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3542, Springer 2005, ISBN 3-540-27829-X [contents] - 2004
- Carlos Ansótegui, Felip Manyà:
Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. SAT (Selected Papers 2004: 1-15 - Alessandro Armando, Claudio Castellini
, Enrico Giunchiglia, Marco Maratea:
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints. SAT (Selected Papers 2004: 16-29 - Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer:
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. SAT (Selected Papers 2004: 30-45 - Marco Benedetti, Sara Bernardini:
Incremental Compilation-to-SAT Procedures. SAT (Selected Papers 2004: 46-58 - Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella:
The Second QBF Solvers Comparative Evaluation. SAT (Selected Papers 2004: 376-392 - Daniel Le Berre, Laurent Simon:
Fifty-Five Solvers in Vancouver: The SAT 2004 Competition. SAT (Selected Papers 2004: 321-344 - Armin Biere:
Resolve and Expand. SAT (Selected Papers 2004: 59-70 - Hans Kleine Büning, Xishun Zhao:
Equivalence Models for Quantified Boolean Formulas. SAT (Selected Papers 2004: 224-234 - Hubie Chen, Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers 2004: 71-79 - Evgeny Dantsin, Alexander Wolpert:
Derandomization of Schuler's Algorithm for SAT. SAT (Selected Papers 2004: 80-88 - Nicola Galesi, Oliver Kullmann:
Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. SAT (Selected Papers 2004: 89-104 - Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QBF Reasoning on Real-World Instances. SAT (Selected Papers 2004: 105-121 - Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais:
Automatic Extraction of Functional Dependencies. SAT (Selected Papers 2004: 122-132 - Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy:
Algorithms for Satisfiability Using Independent Sets of Variables. SAT (Selected Papers 2004: 133-144 - Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren:
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver. SAT (Selected Papers 2004: 345-359 - Marijn Heule, Hans van Maaren:
Aligning CNF- and Equivalence-Reasoning. SAT (Selected Papers 2004: 145-156 - Jinbo Huang, Adnan Darwiche:
Using DPLL for Efficient OBDD Construction. SAT (Selected Papers 2004: 157-172 - Yannet Interian:
Approximation Algorithm for Random MAX- kSAT. SAT (Selected Papers 2004: 173-182 - Paul B. Jackson, Daniel Sheridan:
Clause Form Conversions for Boolean Circuits. SAT (Selected Papers 2004: 183-198 - Haixia Jia, Cristopher Moore, Bart Selman:
From Spin Glasses to Hard Satisfiable Formulas. SAT (Selected Papers 2004: 199-210 - HoonSang Jin, Fabio Somenzi:
CirCUs: A Hybrid Satisfiability Solver. SAT (Selected Papers 2004: 211-223 - Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik:
Zchaff2004: An Efficient SAT Solver. SAT (Selected Papers 2004: 360-375 - Guoqiang Pan, Moshe Y. Vardi:
Search vs. Symbolic Techniques in Satisfiability Solving. SAT (Selected Papers 2004: 235-250 - Stefan Porschen, Ewald Speckenmeyer:
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems. SAT (Selected Papers 2004: 251-262 - Danila A. Sinopalnikov:
Satisfiability Threshold of the Skewed Random k-SAT. SAT (Selected Papers 2004: 263-275 - Sathiamoorthy Subbarayan, Dhiraj K. Pradhan:
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances. SAT (Selected Papers 2004: 276-291 - Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik:
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. SAT (Selected Papers 2004: 292-305 - Dave A. D. Tompkins, Holger H. Hoos:
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. SAT (Selected Papers 2004: 306-320
loading more results 
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-01-08 23:37 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
