Probabilistic game automata (Q1824400): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5833225 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of logical theories / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational Complexity of Probabilistic Turing Machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The knowledge complexity of interactive proof-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite Continuous Time Markov Chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3050157 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solitaire automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of two-player games of incomplete information / rank | |||
Normal rank |
Latest revision as of 09:58, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probabilistic game automata |
scientific article |
Statements
Probabilistic game automata (English)
0 references
1988
0 references
alternating Turing machines
0 references
probabilistic game automaton
0 references
two-person game
0 references
games against unknown nature
0 references