Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Proof Complexity Generators - Krají&

Anglų
2025-06-26
81,65 € 108,86 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

Pristatymas per 22-28 d.d.

30 dienų grąžinimo politika

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 ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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.

Daugiau informacijos

Autorius Krají&
Leidėjas Cambridge University Press
Išleidimo metai 2025
Viršelio tipas Minkšti viršeliai
EAN 9781009611701
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Proof Complexity Generators
Jūsų įvertinimas:

Goodreads Atsiliepimai

81,65 € 108,86 €