Pages that link to "Item:Q4302843"
From MaRDI portal
The following pages link to Space-bounded probabilistic game automata (Q4302843):
Displaying 9 items.
- The complexity of debate checking (Q493647) (← links)
- Checking the correctness of memories (Q890427) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games (Q1590078) (← links)
- Probabilistic game automata (Q1824400) (← links)
- Fast approximate probabilistically checkable proofs (Q1881217) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Achieving Unbounded Resolution in<i>Finite</i>Player Goore Games Using Stochastic Automata, and Its Applications (Q2888572) (← links)
- Random walks on colored graphs (Q4286296) (← links)