Satisfiability problem theory and applications : DIMACS workshop, March 11-13, 1996 /
Saved in:
Other Authors: | Du, Dingzhu., Gu, Jun, 1956-, Pardalos, P. M. 1954-, NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. |
---|---|
Format: | Book |
Language: | English |
Published: |
Providence, R.I. :
American Mathematical Society,
[1997]
|
Physical Description: |
xv, 724 pages : illustrations ; 26 cm. |
Series: |
DIMACS series in discrete mathematics and theoretical computer science ;
v. 35. |
Subjects: |
In Prospector
Similar Items
-
Proof complexity and feasible arithmetics : DIMACS workshop, April 21-24, 1996
Published: (1998) -
Foundations of logic and mathematics : applications to computer science and cryptography
by: Nievergelt, Yves.
Published: (2002) -
Introduction to mathematics of satisfiability
by: Marek, Wiktor.
Published: (2009) -
The theory of computability : programs, machines, effectiveness, and feasibility
by: Sommerhalder, R.
Published: (1988) -
Computability, an introduction to recursive function theory
by: Cutland, Nigel.
Published: (1980)