default search action
Search 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 28 matches
- 2001
- Eyal Amir, Sheila Mcllraith:
Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report). Electron. Notes Discret. Math. 9: 329-343 (2001) - Ramón Béjar, Alba Cabiscol, Cèsar Fernández, Felip Manyà, Carla P. Gomes:
Extending the Reach of SAT with Many-Valued Logics. Electron. Notes Discret. Math. 9: 392-407 (2001) - Daniel Le Berre:
Exploiting the real power of unit propagation lookahead. Electron. Notes Discret. Math. 9: 59-80 (2001) - Renato Bruni, Antonio Sassano:
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae. Electron. Notes Discret. Math. 9: 162-173 (2001) - Hans Kleine Büning, Xishun Zhao:
Satisfiable Formulas Closed Under Replacement. Electron. Notes Discret. Math. 9: 48-58 (2001) - Simona Cocco, Rémi Monasson:
Statistical physics analysis of the backtrack resolution of random 3-SAT instances. Electron. Notes Discret. Math. 9: 36-47 (2001) - Allen Van Gelder:
Combining Preorder and Postorder Resolution in a Satisfiability Solver. Electron. Notes Discret. Math. 9: 115-128 (2001) - Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella, Moshe Y. Vardi:
Towards an Efficient Library for SAT: a Manifesto. Electron. Notes Discret. Math. 9: 290-310 (2001) - Eugene Goldberg:
Proving unsatisfiability of CNFs locally. Electron. Notes Discret. Math. 9: 96-114 (2001) - Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry A. Kautz, Bart Selman, David Maxwell Chickering:
A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report). Electron. Notes Discret. Math. 9: 376-391 (2001) - Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns:
Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems. Electron. Notes Discret. Math. 9: 217-230 (2001) - Bernard Jurkowiak, Chu Min Li, Gil Utard:
Parallelizing Satz Using Dynamic Workload Balancing. Electron. Notes Discret. Math. 9: 174-189 (2001) - Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
The unsatisfiability threshold revisited. Electron. Notes Discret. Math. 9: 81-95 (2001) - Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, Mark E. Stickel:
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report). Electron. Notes Discret. Math. 9: 2-18 (2001) - Henry A. Kautz, Bart Selman:
Preface: Volume 9. Electron. Notes Discret. Math. 9: 1 (2001) - Oliver Kullmann:
On the use of autarkies for satisfiability decision. Electron. Notes Discret. Math. 9: 231-253 (2001) - Michail G. Lagoudakis, Michael L. Littman:
Learning to Select Branching Rules in the DPLL Procedure for Satisfiability. Electron. Notes Discret. Math. 9: 344-359 (2001) - Inês Lynce, Luís Baptista, João Marques-Silva:
Stochastic Systematic Search Algorithms for Satisfiability. Electron. Notes Discret. Math. 9: 190-204 (2001) - Sheila Mcllraith, Eyal Amir:
Theorem Proving with Structured Theories (Preliminary Report)*. Electron. Notes Discret. Math. 9: 311-328 (2001) - Tom Morrisette:
The Unreasonable Effectiveness of Alternation-Based Satisfiability Algorithms. Electron. Notes Discret. Math. 9: 254-268 (2001) - Breanndán Ó Nualláin, Maarten de Rijke, Johan van Benthem:
Ensemble-based prediction of SAT search behaviour. Electron. Notes Discret. Math. 9: 278-289 (2001) - Donald J. Patterson, Henry A. Kautz:
Auto-Walksat: A Self-Tuning Implementation of Walksat. Electron. Notes Discret. Math. 9: 360-368 (2001) - Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek:
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9: 269-277 (2001) - Andrea Roll:
Criticality and Parallelism in GSAT. Electron. Notes Discret. Math. 9: 150-161 (2001) - Ilya Shlyakhter:
Generating effective symmetry-breaking predicates for search problems. Electron. Notes Discret. Math. 9: 19-35 (2001) - Laurent Simon, Philippe Chatalic:
SatEx: A Web-based Framework for SAT Experimentation. Electron. Notes Discret. Math. 9: 129-149 (2001) - Carsten Sinz, Wolfgang Blochinger, Wolfgang Küchlin:
PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. Electron. Notes Discret. Math. 9: 205-216 (2001) - K. Subramani:
A polyhedral projection procedure for Q2SAT. Electron. Notes Discret. Math. 9: 369-375 (2001)
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 2024-10-16 05:48 CEST 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