Arthur and Merlin as Oracles (Q3599130)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Arthur and Merlin as Oracles	scientific article

Statements

scholarly article

0 references

Arthur and Merlin as Oracles (English)

0 references

Venkatesan T. Chakaravarthy

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

3 February 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-85238-4_18

0 references

On sparse approximations to randomized strategies and convex combinations

0 references

Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes

0 references

0 references

0 references

On the complexity of succinct zero-sum games

0 references

Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses

0 references

Simple strategies for large zero-sum games with applications to complexity theory

0 references

Derandomizing Arthur-Merlin games using hitting sets

0 references

Private vs. common random bits in communication complexity

0 references

Hardness vs randomness

0 references

0 references

0 references

Pseudorandomness for approximate counting and sampling

0 references

Optimal orientations of cells in slicing floorplan designs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-85238-4_18

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3599130

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3599130&oldid=35091585"