Остановите войну!
for scientists:
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 26 matches
- 1997
- Ding-Zhu Du, Jun Gu, Panos M. Pardalos:
Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, DIMACS/AMS 1997, ISBN 978-0-8218-0479-7 [contents] - 1996
- Shawki Areibi, Anthony Vannelli:
A GRASP clustering technique for circuit partitioning. Satisfiability Problem: Theory and Applications 1996: 711-724 - Roberto Battiti, Marco Protasi:
Solving MAX-SAT with non-oblivious functions and history-based heuristics. Satisfiability Problem: Theory and Applications 1996: 649-667 - Stephen A. Cook, David G. Mitchell:
Finding hard instances of the satisfiability problem: A survey. Satisfiability Problem: Theory and Applications 1996: 1-17 - John Franco:
Relative size of certain polynomial time solvable subclasses of satisfiability. Satisfiability Problem: Theory and Applications 1996: 211-223 - Jun Gu:
Multispace search for satisfiability and NP-hard problems. Satisfiability Problem: Theory and Applications 1996: 407-517 - Jun Gu, Paul W. Purdom, John V. Franco, Benjamin W. Wah:
Algorithms for the satisfiability (SAT) problem: A survey. Satisfiability Problem: Theory and Applications 1996: 19-151 - Jieh Hsiang, Guan-Shieng Huang:
Some fundamental properties of Boolean ring normal forms. Satisfiability Problem: Theory and Applications 1996: 587-602 - Kazuo Iwama, Kazuya Takaki:
Satisfiability of 3CNF formulas with small clause/variable-ratio. Satisfiability Problem: Theory and Applications 1996: 315-333 - Steve Joy, John E. Mitchell, Brian Borchers:
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT. Satisfiability Problem: Theory and Applications 1996: 519-536 - Henry A. Kautz, Bart Selman, YueYen Jiang:
A general stochastic approach to solving problems with hard and soft constraints. Satisfiability Problem: Theory and Applications 1996: 573-585 - Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc:
A better upper bound for the unsatisfiability threshold. Satisfiability Problem: Theory and Applications 1996: 643-648 - Oliver Kullman:
Worst-case analysis, 3-SAT decision and lower bounds: Approaches for improved SAT algorithms. Satisfiability Problem: Theory and Applications 1996: 261-313 - Arne Løkketangen, Fred W. Glover:
Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems. Satisfiability Problem: Theory and Applications 1996: 537-572 - Hans van Maaren:
On the use of second order derivatives for the satisfiability problem. Satisfiability Problem: Theory and Applications 1996: 677-687 - Madhav V. Marathe, Harry B. Hunt III, Richard Edwin Stearns, Venkatesh Radhakrishnan:
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results. Satisfiability Problem: Theory and Applications 1996: 225-259 - David A. Plaisted, Geoffrey D. Alexander:
Propositional search efficiency and first-order theorem proving. Satisfiability Problem: Theory and Applications 1996: 335-350 - Paul Walton Purdom Jr., G. Neil Haven:
Backtracking and probing. Satisfiability Problem: Theory and Applications 1996: 153-209 - Mauricio G. C. Resende, Leonidas S. Pitsoulis, Panos M. Pardalos:
Approximate solution of weighted MAX-SAT problems using GRASP. Satisfiability Problem: Theory and Applications 1996: 393-405 - Craig K. Rushforth, Wei Wang:
Local search for channel assignment in cellular mobile networks. Satisfiability Problem: Theory and Applications 1996: 689-709 - Sandeep K. Shukla, Daniel J. Rosenkrantz, Harry B. Hunt III, Richard Edwin Stearns:
The polynomial time decidability of simulation relations for finite processes: A HORNSAT based approach. Satisfiability Problem: Theory and Applications 1996: 603-641 - Ewald Speckenmeyer, Max Böhm, Peter Heusch:
On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers. Satisfiability Problem: Theory and Applications 1996: 669-676 - Benjamin Wan-Sang Wah, Yi Shang:
A discrete Lagrangian-based global-search method for solving satisfiability problems. Satisfiability Problem: Theory and Applications 1996: 365-392 - Jinchang Wang:
Branching rules for propositional satisfiability test. Satisfiability Problem: Theory and Applications 1996: 351-364 - Foreword. Satisfiability Problem: Theory and Applications 1996: xiii-
- Preface. Satisfiability Problem: Theory and Applications 1996: xv-
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-05-28 17:00 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