From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) (Q2958508)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) |
scientific article |
Statements
2 February 2017
0 references
computational complexity
0 references
recursion schemes
0 references
P
0 references
NP
0 references
Pspace
0 references
From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) (English)
0 references
0 references
0.8428471
0 references
0.8382962
0 references
0 references
