The complexity of searching succinctly represented graphs (Q4645179)
From MaRDI portal
scientific article; zbMATH DE number 6999433
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of searching succinctly represented graphs |
scientific article; zbMATH DE number 6999433 |
Statements
The complexity of searching succinctly represented graphs (English)
0 references
10 January 2019
0 references
polynomial time
0 references
complexity class
0 references
Boolean circuit
0 references
trivial graph
0 references
goal vertex
0 references
0 references
