A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (Q4686644): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-46376-6_3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2547032772 / rank | |||
Normal rank | |||
Revision as of 01:09, 20 March 2024
scientific article; zbMATH DE number 6946906
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle |
scientific article; zbMATH DE number 6946906 |
Statements
A Hierarchy for $$ BPP //\log \!\star $$ B P P / / log ⋆ Based on Counting Calls to an Oracle (English)
0 references
4 October 2018
0 references
random walk
0 references
polynomial time
0 references
Turing machine
0 references
advice function
0 references
oracle query
0 references
