Probabilistic polynomial time is closed under parity reductions (Q751270)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4176443
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic polynomial time is closed under parity reductions |
scientific article; zbMATH DE number 4176443 |
Statements
Probabilistic polynomial time is closed under parity reductions (English)
0 references
1991
0 references
computational complexity
0 references
probabilistic polynomial time
0 references
