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

Parity P: Computational Complexity Theory, Complexity Class -

inglise keel
2026-03-26
117,44 € 195,73 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, the complexity class {oplus}mathbf{P} (pronounced "parity P") is the class of decision problems solvable by a nondeterministic Turing machine in polynomial time, where the acceptance condition is that the number of accepting computation paths is ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, the complexity class {oplus}mathbf{P} (pronounced "parity P") is the class of decision problems solvable by a nondeterministic Turing machine in polynomial time, where the acceptance condition is that the number of accepting computation paths is odd. An example of a {oplus}mathbf{P} problem is "does a given graph have an odd number of perfect matchings?" The class was defined by Papadimitriou and Zachos in 1983.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786133196421
Kirjuta oma arvustus
Te vaatate: Parity P: Computational Complexity Theory, Complexity Class
Teie hinnang:

Goodreads'i arvustused

117,44 € 195,73 €