Probabilistic polynomial time is closed under parity reductions (Q751270): Difference between revisions
From MaRDI portal
Latest revision as of 11:48, 21 June 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