Bounded-depth succinct encodings and the structure they imply on graphs (Q722204)
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 6909384
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounded-depth succinct encodings and the structure they imply on graphs |
scientific article; zbMATH DE number 6909384 |
Statements
Bounded-depth succinct encodings and the structure they imply on graphs (English)
0 references
23 July 2018
0 references
complexity
0 references
succinct
0 references
circuits
0 references
biclique
0 references
graphs
0 references
NP
0 references
0.7839450836181641
0 references
0.7644174098968506
0 references
0.7596660256385803
0 references
