Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree |
scientific article |
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
