Derandomizing Arthur-Merlin games using hitting sets (Q813315)
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 5005125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derandomizing Arthur-Merlin games using hitting sets |
scientific article; zbMATH DE number 5005125 |
Statements
Derandomizing Arthur-Merlin games using hitting sets (English)
0 references
8 February 2006
0 references
derandomization
0 references
interactive proof systems
0 references
complexity classes
0 references
graph nonisomorphism
0 references
0.94302475
0 references
0 references
0.8901645
0 references
0.8813689
0 references
0.87881434
0 references
0.8593874
0 references
0.8479732
0 references
0.8458143
0 references
