Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Proof Complexity Generators - Krají&

inglise keel
2025-06-26
81,65 € 108,86 €

-25% koodiga BOOKS

Meie tarnija laos

Saadetis 22-28 tööpäeva jooksul

30-päevane tagastamisõigus

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 pro ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Krají&
Kirjastaja Cambridge University Press
Väljalaskeaasta 2025
Kaanetüüp Pehme kaanega
EAN 9781009611701
Kirjuta oma arvustus
Te vaatate: Proof Complexity Generators
Teie hinnang:

Goodreads'i arvustused

81,65 € 108,86 €