Theory and Applications of Satisfiability Testing - SAT 2006
Springer Berlin Heidelberg
Chapter title |
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
|
---|---|
Chapter number | 26 |
Book title |
Theory and Applications of Satisfiability Testing - SAT 2006
|
Published by |
Springer, Berlin, Heidelberg, August 2006
|
DOI | 10.1007/11814948_26 |
Book ISBNs |
978-3-54-037206-6, 978-3-54-037207-3
|
Authors |
Evgeny Dantsin, Alexander Wolpert, Dantsin, Evgeny, Wolpert, Alexander |
Country | Count | As % |
---|---|---|
Russia | 1 | 33% |
Unknown | 2 | 67% |
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 33% |
Researcher | 1 | 33% |
Lecturer > Senior Lecturer | 1 | 33% |
Student > Master | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Engineering | 1 | 33% |