A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison (Q2404077)
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 6774154
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A novel characterization of the complexity class \(\Theta_k^{\mathrm{P}}\) based on counting and comparison |
scientific article; zbMATH DE number 6774154 |
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
0.7538545727729797
0 references
0.7317752242088318
0 references
0.7317084074020386
0 references
0.7221131920814514
0 references
