Decomposition of graphs and monotone formula size of homogeneous functions
From MaRDI portal
Publication:1071036
DOI10.1007/BF00264314zbMath0585.05031MaRDI QIDQ1071036
Publication date: 1986
Published in: Acta Informatica (Search for Journal in Brave)
quadratic functioncomplete bipartite graphshomogeneous functionsmonotone formulauniform hypergraphsgraph decompositiongraph partition
Related Items
Secret-sharing schemes for very dense graphs, Improved boolean formulas for the Ramsey graphs, Representations of graphs and networks (coding, layouts and embeddings), Gate Elimination for Linear Functions and New Feebly Secure Constructions, Finding bipartite subgraphs efficiently, Secret Sharing Schemes for Dense Forbidden Graphs, The conjunctive complexity of quadratic Boolean functions
Cites Work