Probabilistic polynomial time is closed under parity reductions (Q751270): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q161382 |
Changed an Item |
||
| Property / author | |||
| Property / author: Hemaspaandra, Lane A. / rank | |||
Normal rank | |||
Revision as of 19:49, 9 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Probabilistic polynomial time is closed under parity reductions |
scientific article |
Statements
Probabilistic polynomial time is closed under parity reductions (English)
0 references
1991
0 references
computational complexity
0 references
probabilistic polynomial time
0 references
