ParhainHinta.fi
Proof Complexity Generators

cambridge university press

Proof Complexity Generators

Alin havaittu hinta

59,10 €
1 kauppa

Hinnat kaupoissa

1 tarjous
Adlibris
Havaittu
59,10 €
Siirry kauppaan

Hinnat ovat viimeksi havaittuja. Tarkista ajantasainen hinta, saatavuus ja toimituskulut kaupasta.

Hintahistoria

2 hintahavaintoa

Kaavio näyttää kunkin havaintopäivän alimman tallennetun tuotehinnan. Havaintojen välistä hintaa ei ole vahvistettu.

Alin havaittu
59,10 €
Korkein havaittu
62,90 €
Viimeisin historian havainto
Hintahistoria: 2 havaintopäivää59,10 €62,90 €29.10.2026: 62,90 €31.10.2026: 59,10 €29.10.202631.10.2026
Näytä kaikki 2 hintahavaintoa
Hinta havaittu (Suomen aika)Hinta
62,90 €
59,10 €

Tuotetiedot

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.

Brändi
cambridge university press
EAN / GTIN
9781009611701