Computational Complexity of Graphs

DOI10.1002/9783527670468.ch05zbMath1328.05181OpenAlexW1518577411MaRDI QIDQ3463386

Stasys P. Jukna

Publication date: 14 January 2016

Published in: Advances in Network Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/9783527670468.ch05

zbMATH Keywords

bipartite graphBoolean functionslower boundsgraph entropyBoolean matrixconjunctive normal formgraph complexityRamsey graphSylvester graphtransposition principlerectifier networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

On the extension complexity of polytopes separating subsets of the Boolean cube

This page was built for publication: Computational Complexity of Graphs