There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 52

Record: found
Abstract: not found
Article: not found

The complexity of computing the permanent

L.G. Valiant (1979)

0 comments Cited 451 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

The Complexity of Enumeration and Reliability Problems

Leslie Valiant (1979)

0 comments Cited 262 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

PP is as Hard as the Polynomial-Time Hierarchy

Seinosuke Toda (1991)

0 comments Cited 103 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2008

Pages: 3-37

DOI: 10.1007/978-3-540-92800-3_2

SO-VID: 0a4dab4f-476c-4e85-8728-f35e77b38925

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 8

See all cited by

Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?

Read this book at

Related collections

Emerald: Fairer Society

Most cited references 52

The complexity of computing the permanent

The Complexity of Enumeration and Reliability Problems

PP is as Hard as the Polynomial-Time Hierarchy

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 1,503

Cited by 8