Structural complexity of AvgBPP (Q638488): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apal.2010.09.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1979324521 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4440438 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of average case complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3413362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Complete Public-Key Cryptosystem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4036598 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Robust Combiners for Oblivious Transfer and Other Primitives / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3802608 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3819053 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Average Case Complete Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generic time hierarchy with one bit of advice / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Structural complexity of AvgBPP |
scientific article |
Statements
Structural complexity of AvgBPP (English)
0 references
12 September 2011
0 references
average-case complexity
0 references
BPP
0 references
complete problems
0 references
errorless heuristics
0 references
randomized algorithms
0 references
time hierarchy
0 references