scientific article; zbMATH DE number 1559566

MaRDI QIDQ4527018zbMATH OpenFDO

Authors Joe Kilian, Uriel Feige

Publication date 28 February 2001

zbMATH Keywords

complexityEXPTIME statementincomplete informationrefereed games

Mathematics Subject Classification ID

Games of timing (91A55)

Recommendations

• scientific article; zbMATH DE number 18527
• Polynomial games and determinacy
• On games of incomplete information
• The complexity of two-player games of incomplete information
• Lower bounds for multiplayer noncooperative games of incomplete information

Cited in

(10)

• Parallel approximation of min-max problems
• Refereed delegation of computation
• The complexity of debate checking
• Shorter arithmetization of nondeterministic computations
• Constant-round interactive proofs for delegating computation
• Non-cooperative rational interactive proofs
• Complexity limitations on one-turn quantum refereed games
• The entangled quantum polynomial hierarchy collapses
• Short paper: naysayer proofs
• Outsourcing computation: the minimal refereed mechanism

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527018)