A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison |
scientific article |
Statements
A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (English)
0 references
12 September 2017
0 references
complexity class \(\Theta_k^{\mathrm{P}}\)
0 references
polynomial hierarchy
0 references
computation with oracles
0 references
counting and comparison
0 references
\(\Theta_k^{\mathrm{P}}\)-complete problem
0 references
