Store besparelser
Hurtig levering
Fri fragt over 499,-
Gemte
Log ind
0
Kurv
Kurv
Proof Complexity Generators
Engelsk Paperback

Proof Complexity Generators

Engelsk Paperback

541 kr
Tilføj til kurv
Sikker betaling
6 - 8 hverdage

Om denne bog
The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research.
Product detaljer
Sprog:
Engelsk
Sider:
134
ISBN-13:
9781009611701
Indbinding:
Paperback
Udgave:
ISBN-10:
1009611704
Kategori:
Udg. Dato:
26 jun 2025
Længde:
9mm
Bredde:
153mm
Højde:
228mm
Forlag:
Cambridge University Press
Oplagsdato:
26 jun 2025
Forfatter(e):
Finder produkter...
Kategori sammenhænge