20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Parity P: Computational Complexity Theory, Complexity Class -

English
2026-03-26
€156.58 €195.73

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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 ... Full description

You May Also Like

Description

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.

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786133196421
Write Your Own Review
You're reviewing: Parity P: Computational Complexity Theory, Complexity Class
Your Rating:

Goodreads Reviews

€156.58 €195.73