Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers > Satisfiability and Computing van der Waerden Numbers
Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers |
Enrico Giunchiglia; Armando Tacchella
Springer Berlin Heidelberg
Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003, Selected Revised Papers
Satisfiability and Computing van der Waerden Numbers
Authors

Michael R. Dransfield; Victor W. Marek; Mirosław Truszczyński

ARI Id

1664573286440_2256351

Access

Not Available Free

Pages

1-13

DOI

10.1007/978-3-540-24605-3_1

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-24605-3_1

Table of Contents of Book
Showing 1 to 20 of 40 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Satisfiability and Computing van der Waerden Numbers
Michael R. Dransfield; Victor W. Marek; Mirosław Truszczyński
1-13
An Algorithm for SAT Above the Threshold
Hubie Chen
14-24
Watched Data Structures for QBF Solvers
Ian Gent; Enrico Giunchiglia; Massimo Narizzano; Andrew Rowley; Armando Tacchella
25-36
How Good Can a Resolution Based SAT-solver Be?
Eugene Goldberg; Yakov Novikov
37-52
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation
Xiao Yu Li; Matthias F. Stallmann; Franc Brglez
53-68
Density Condensation of Boolean Formulas
Youichi Hanatani; Takashi Horiyama; Kazuo Iwama
69-77
SAT Based Predicate Abstraction for Hardware Verification
Edmund Clarke; Muralidhar Talupur; Helmut Veith; Dong Wang
78-92
On Boolean Models for Quantified Boolean Horn Formulas
Hans Kleine Büning; K. Subramani; Xishun Zhao
93-104
Local Search on SAT-encoded Colouring Problems
Steven Prestwich
105-119
A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods
Guilhem Semerjian; Rémi Monasson
120-134
Hidden Threshold Phenomena for Fixed-Density SAT-formulae
Hans van Maaren; Linda van Norden
135-149
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs
Sven Baumer; Rainer Schuler
150-161
Width-Based Algorithms for SAT and CIRCUIT-SAT
Elizabeth Broering; Satyanarayana V. Lokam
162-171
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems
Stefan Porschen; Bert Randerath; Ewald Speckenmeyer
172-187
On Fixed-Parameter Tractable Parameterizations of SAT
Stefan Szeider
188-202
On the Probabilistic Approach to the Random Satisfiability Problem
Giorgio Parisi
203-213
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
Uwe Egly; Martina Seidl; Hans Tompits; Stefan Woltran; Michael Zolda
214-228
Solving Error Correction for Large Data Sets by Means of a SAT Solver
Renato Bruni
229-241
Using Problem Structure for Efficient Clause Learning
Ashish Sabharwal; Paul Beame; Henry Kautz
242-256
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 40 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings