Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223)
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 4139296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree |
scientific article; zbMATH DE number 4139296 |
Statements
Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (English)
0 references
1990
0 references
graph accessibility problem
0 references
logarithmic space-bounded computation
0 references
nonuniform branching programs
0 references
0 references
0.8802348
0 references
0.8675146
0 references
0.8625367
0 references
0 references
0.8607699
0 references
