Computational complexity of graphs (Q3463386)
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 6529987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of graphs |
scientific article; zbMATH DE number 6529987 |
Statements
Computational Complexity of Graphs (English)
0 references
14 January 2016
0 references
Boolean functions
0 references
bipartite graph
0 references
graph complexity
0 references
graph entropy
0 references
conjunctive normal form
0 references
rectifier networks
0 references
transposition principle
0 references
Boolean matrix
0 references
Ramsey graph
0 references
Sylvester graph
0 references
lower bounds
0 references
0.8530897498130798
0 references
0.7991228103637695
0 references
0.7730450630187988
0 references
0.7611486911773682
0 references
