scientific article; zbMATH DE number 1302031

MaRDI QIDQ4247274zbMATH OpenFDO

Authors Satyanarayana V. Lokam

Publication date 5 October 1999

zbMATH Keywords

2-slice functionsgraph complexitysuperlinear monotone lower bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Graph complexity and slice functions
• On Graph Complexity
• Graph complexity
• More on the complexity of slice functions
• The monotone circuit complexity of Boolean functions

Cited in

(7)

• Decomposition of graphs and monotone formula size of homogeneous functions
• The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
• On the CNF-complexity of bipartite graphs containing no squares
• scientific article; zbMATH DE number 3874608 (Why is no real title available?)
• scientific article; zbMATH DE number 3876594 (Why is no real title available?)
• On Graph Complexity
• On the complexity of some problems related to graph extensions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247274)