A Survey of Lower Bounds for Satisfiability and Related Problems Image close
A Survey of Lower Bounds for Satisfiability and Related Problems by Dieter Melkebeek
A Survey of Lower Bounds for Satisfiability and Related Problems by Dieter Melkebeek
Show Hide Adult Content
A Survey of Lower Bounds for Satisfiability and Related Problems close

Computers & Internet Books:

Home  
Books  
Computers & Internet  
Theory & Design

A Survey of Lower Bounds for Satisfiability and Related Problems

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$173.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $43.50 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 12-24 June using International Courier

Explore more Foundations and Trends(R) in Theoretical Computer Science

See all products in this series

Higher-order Fourier Analysis and Applications by Hamed Hatami
$212.99
Higher-order Fourier Analysis and Applications
by Hamed Hatami ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Communication Complexity (for Algorithm Designers) by Tim Roughgarden
$212.99
Communication Complexity (for Algorithm Designers)
by Tim Roughgarden ~ Paperback / softback
Available - Usually ships in 3-4 weeks
On Doubly-Efficient Interactive Proof Systems by Oded Goldreich
$162.99
On Doubly-Efficient Interactive Proof Systems
by Oded Goldreich ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithms and Data Structures for External Memory by Jeffrey Scott Vitter
$212.99
Algorithms and Data Structures for External Memory
by Jeffrey Scott Vitter ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Complexity Lower Bounds using Linear Algebra by Satya Lokam
$212.99
Complexity Lower Bounds using Linear Algebra
by Satya Lokam ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Bayesian Mechanism Design by Jason D. Hartline
$193.99
Bayesian Mechanism Design
by Jason D. Hartline ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Data Streams by S. Muthukrishnan
$131.99
Data Streams
by S. Muthukrishnan ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Faster Algorithms via Approximation Theory by Sushant Sachdeva
$162.99
Faster Algorithms via Approximation Theory
by Sushant Sachdeva ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Multi-Valued Reasoning about Reactive Systems by Orna Kupferman
$175.99
Multi-Valued Reasoning about Reactive Systems
by Orna Kupferman ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Probabilistic Proof Systems by Oded Goldreich
$162.99
Probabilistic Proof Systems
by Oded Goldreich ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Decade of Lattice Cryptography by Chris Peikert
$212.99
A Decade of Lattice Cryptography
by Chris Peikert ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Lx = b by Nisheeth K. Vishnoi
$212.99
Lx = b
by Nisheeth K. Vishnoi ~ Paperback / softback
Available - Usually ships in 3-4 weeks
On the Power of Small-Depth Computation by Emanuele Viola
$142.99
On the Power of Small-Depth Computation
by Emanuele Viola ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithmic and Analysis Techniques in Property Testing by Dana Ron
$212.99
Algorithmic and Analysis Techniques in Property Testing
by Dana Ron ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Quantum Proofs by Thomas Vidick
$213.99
Quantum Proofs
by Thomas Vidick ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Paradigms for Unconditional Pseudorandom Generators by Pooya Hatami
$214.99
Paradigms for Unconditional Pseudorandom Generators
by Pooya Hatami ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Description

NP-completeness arguably forms the most pervasive concept from computer science as it captures the computational complexity of thousands of important problems from all branches of science and engineering. The P versus NP question asks whether these problems can be solved in polynomial time. A negative answer has been widely conjectured for a long time but, until recently, no concrete lower bounds were known on general models of computation. Satisfiability is the problem of deciding whether a given Boolean formula has at least one satisfying assignment. It is the first problem that was shown to be NP-complete, and is possibly the most commonly studied NP-complete problem, both for its theoretical properties and its applications in practice. A Survey of Lower Bounds for Satisfiability and Related Problems surveys the recently discovered lower bounds for the time and space complexity of satisfiability and closely related problems. It overviews the state-of-the-art results on general deterministic, randomized, and quantum models of computation, and presents the underlying arguments in a unified framework. This is an invaluable reference for professors and students doing research in complexity theory, or planning to do so.
Release date Australia
October 25th, 2007
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
  • Undergraduate
Pages
128
Dimensions
156x234x7
ISBN-13
9781601980847
Product ID
2361734

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Computers & Internet >
Theory & Design
Books >
Computers & Internet >
Computer Applications
Books >
Computers & Internet >
Computer science