Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
27
views
0
references
Top references
cited by
2
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,441
similar
All similar
Record
: found
Abstract
: not found
Book
: not found
Satisfiability Problem: Theory and Applications
monograph
Editor(s):
Dingzhu Du
,
Jun Gu
,
Panos Pardalos
Publication date
(Print):
December 9 1997
Publisher:
American Mathematical Society
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Numerical Algebra, Matrix Theory, Differential-Algebraic Equations, and Control Theory
Author and book information
Book
ISBN (Print):
9780821804797
ISBN (Electronic):
9781470439934
Publication date (Print):
December 9 1997
DOI:
10.1090/dimacs/035
SO-VID:
601c23be-84d3-44ce-bf6d-892cb4061105
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Finding hard instances of the satisfiability problem: A survey
pp. 19
Algorithms for the satisfiability (SAT) problem: A survey
pp. 393
Approximate solution of weighted MAX-SAT problems using GRASP
pp. 573
A general stochastic approach to solving problems with hard and soft constraints
Similar content
4,441
A Complete Diagrammatic Calculus for Boolean Satisfiability
Authors:
Tao Gu
,
Robin Piedeleu
,
Fabio Zanasi
Theory and Applications of Satisfiability Testing
Authors:
N. NISHIMURA
Anisotropic compact star model satisfying Karmarkar conditions
Authors:
D. Pandya
,
B Thakore
,
R. Goti
…
See all similar
Cited by
2
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
Authors:
Joao Marques-Silva
Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms
Authors:
Remi Monasson
,
Simona Cocco
See all cited by