Computing with a fixed number of pointers (invited talk) (Q2963894)
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 6687749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing with a fixed number of pointers (invited talk) |
scientific article; zbMATH DE number 6687749 |
Statements
21 February 2017
0 references
logarithmic space
0 references
jumping graph automata
0 references
st-connectivity
0 references
co-st-connectivity
0 references
Cayley graphs
0 references
Computing With a Fixed Number of Pointers (Invited Talk). (English)
0 references
0.7273699641227722
0 references
0.7259691953659058
0 references
0.7197504043579102
0 references
0.7185673713684082
0 references
0.7125316858291626
0 references
