|
|
|
|
| LEADER |
05020cam a2200601 a 4500 |
| 001 |
37180933 |
| 003 |
OCoLC |
| 005 |
20020408082759.8 |
| 008 |
970611t19971997riua b 100 0 eng |
| 010 |
|
|
|a 97025448
|
| 016 |
|
|
|a 980050669
|
| 020 |
|
|
|a 0821804790
|q alkaline paper
|
| 040 |
|
|
|a DLC
|b eng
|c DLC
|d PMC
|d NLC
|d OCL
|d COM
|
| 049 |
|
|
|a COMA
|
| 050 |
0 |
0 |
|a QA9.3
|b .S38 1997
|
| 055 |
0 |
1 |
|a QA9.3
|
| 082 |
0 |
0 |
|a 511.3
|2 21
|
| 245 |
0 |
0 |
|a Satisfiability problem :
|b theory and applications : DIMACS workshop, March 11-13, 1996 /
|c Dingzhu Du, Jun Gu, Panos M. Pardalos, editors.
|
| 264 |
|
1 |
|a Providence, R.I. :
|b American Mathematical Society,
|c [1997]
|
| 264 |
|
4 |
|c ©1997.
|
| 300 |
|
|
|a xv, 724 pages :
|b illustrations ;
|c 26 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent.
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia.
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier.
|
| 490 |
1 |
|
|a DIMACS series in discrete mathematics and theoretical computer science,
|x 1052-1798 ;
|v v. 35.
|
| 500 |
|
|
|a "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Bellcore."
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
|
|a Finding hard instances of the satisfiabilty problem : a survey / Stephen A. Cook and David G. Mitchell -- Algorithms for the satisfiability (SAT) problem : a survey / Jun Gu ... [et al.] -- Backtracking and probing / Paul Walton Purdom and G. Neil Haven -- Relative size of certain polynomial time solvable subclasses of satisfiability / J. Franco -- Complexity of hierarchically and 1-dimensional periodically specified problems I : hardness results / Madhav V. Marathe ... [et al.] -- Worst-case analysis, 3-SAT decision and lower bounds : approaches for improved SAT algorithms / Oliver Kullmann -- Satisfiability of 3CNF formulas with small clause/variable-ratio / Kazuo Iwama and Kazuya Takaki -- Propositional search efficiency and first-order theorem proving / David A. Plaisted and Geoffrey D. Alexander -- Branching rules for propositional satisfiabilty test / Jinchang Wang -- A discrete Lagrangian-based global-search method for solving satisfiability problems / Benjamin W. Wah and Yi Shang -- Approximate solution of weighted MAX-SAT problems using GRASP / M.G.C. Resende, L.S. Pitsoulis, and P.M. Pardalos -- Multispace search for satisfiability and NP-hard problems / Jun Gu -- A branch and cut algorithm for MAX-SAT and weighted MAX-SAT / Steve Joy, John Mitchell, and Brian Borchers -- Surrogate constraint analysis : new heuristics and learning schemes for satisfiabilty problems / Arne Løkketangen and Fred Glover -- A general stochastic approach to solving problems with hard and soft constraints / Henry Kautz, Bart Selman, and YueYen Jiang -- Some fundamental properties of Boolean ring normal forms / Jieh Hsiang and Guan Shieng Huang -- The polynomial time decidability of simulation relations for finite state processes : a HORNSAT based approach / Sandeep K. Shukla ... [et al.] -- A better upper bound for the unsatisfiabilty threshold / Lefteris M. Kirousis, Evangelos Kranakis, and Danny Krizanc -- Solving MAX-SAT with non-oblivious functions and history-based heuristics / Roberto Battiti and Marco Protasi -- On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers / Ewald Speckenmeyer, Max Böhm, and Peter Heusch -- On the use of second order derivatives for the satisfiability problem / Hans van Maaren -- Local search for channel assignment in cellular mobile networks / Craig K. Rushforth and Wei Wang -- A GRASP clustering technique for circuit partitioning / Shawki Areibi and Anthony Vannelli.
|
| 650 |
|
0 |
|a Propositional calculus
|v Congresses.
|
| 650 |
|
0 |
|a Decision making
|v Congresses.
|
| 650 |
|
0 |
|a Computer algorithms
|v Congresses.
|
| 650 |
|
0 |
|a Computer science
|v Congresses.
|
| 655 |
|
7 |
|a Congresses.
|2 lcgft.
|
| 655 |
|
7 |
|a Conference papers and proceedings.
|2 lcgft.
|
| 700 |
1 |
|
|a Du, Dingzhu.
|
| 700 |
1 |
|
|a Gu, Jun,
|d 1956-
|
| 700 |
1 |
|
|a Pardalos, P. M.
|q (Panos M.),
|d 1954-
|
| 710 |
2 |
|
|a NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science.
|
| 830 |
|
0 |
|a DIMACS series in discrete mathematics and theoretical computer science ;
|v v. 35.
|
| 907 |
|
|
|a .b20594082
|b cu
|c -
|d 020408
|e 230519
|
| 998 |
|
|
|a cu
|b 020408
|c m
|d a
|e -
|f eng
|g riu
|h 0
|i 0
|
| 902 |
|
|
|a 060630
|
| 948 |
|
|
|a MARCIVE Comp, in 2022.12
|
| 948 |
|
|
|a MARCIVE Comp, 2018.05
|
| 948 |
|
|
|a MARCIVE Comp, 2017.10
|
| 948 |
|
|
|a MARCIVE August, 2017
|
| 948 |
|
|
|a MARCIVE extract Aug 5, 2017
|
| 994 |
|
|
|a 01
|b COM
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2022.12
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2018.06
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2017.10
|
| 995 |
|
|
|a Loaded with m2btab.ltiac in 2017.08
|
| 989 |
|
|
|a QA9.3
|r .S38 1997
|d culmb
|b 1080005073565
|e 08-14-2023 8:18
|f - -
|g -
|h 1
|i 0
|j 18
|k 020408
|l $0.00
|m
|n 09-26-2023 13:05
|o -
|p 372
|q 0
|t 1
|x 0
|1 .i32650991
|