Jump to ContentJump to Main Navigation

You are looking at 1-3 of 3 items

  • Keywords: Boolean formulas x
Clear All Modify Search

View:

Needles in a Haystack: the Class NP

Cristopher Moore and Stephan Mertens

in The Nature of Computation

Published in print:
2011
Published Online:
December 2013
ISBN:
9780199233212
eISBN:
9780191775079
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/acprof:oso/9780199233212.003.0004
Subject:
Physics, Theoretical, Computational, and Statistical Physics

NP refers to a class of decision problems in which yes-instances are easy to verify. That is: a decision problem is in NP if, whenever the answer for a particular instance is ‘yes’, there is a simple ... More


Introduction: Where Statistical Physics Meets Computation

Allon G. Percus, Gabriel Istrate, and Cristopher Moore

in Computational Complexity and Statistical Physics

Published in print:
2005
Published Online:
November 2020
ISBN:
9780195177374
eISBN:
9780197562260
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/oso/9780195177374.003.0007
Subject:
Computer Science, Mathematical Theory of Computation

Computer science and physics have been closely linked since the birth of modern computing. This book is about that link. John von Neumann’s original design for digital computing in the 1940s was ... More


Proving Conditional Randomness using the Principle of Deferred Decisions

Alexis C. Kaporis and Lefteris M. Kirousis

in Computational Complexity and Statistical Physics

Published in print:
2005
Published Online:
November 2020
ISBN:
9780195177374
eISBN:
9780197562260
Item type:
chapter
Publisher:
Oxford University Press
DOI:
10.1093/oso/9780195177374.003.0016
Subject:
Computer Science, Mathematical Theory of Computation

In order to prove that a certain property holds asymptotically for a restricted class of objects such as formulas or graphs, one may apply a heuristic on a random element of the class, and then ... More


View: