The complexity of debate checking (Q493647)
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 6478530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of debate checking |
scientific article; zbMATH DE number 6478530 |
Statements
The complexity of debate checking (English)
0 references
4 September 2015
0 references
incomplete information debates
0 references
private alternation
0 references
games
0 references
probabilistic computation
0 references
0 references
0 references
0.83483326
0 references
0 references
0.7807283
0 references
0.77918726
0 references
0.77475274
0 references
0.76112473
0 references
