Graph complexity
From MaRDI portal
Publication:1823693
zbMATH Open0681.68070MaRDI QIDQ1823693FDOQ1823693
Authors: Pavel Pudlák, Petr Savický, Vojtěch Rödl 
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
Cited In (26)
- Generalisations of matrix partitions: complexity and obstructions
- Monoidal Width: Capturing Rank Width
- Limits of preprocessing
- The complexity of finite graphs
- Monoidal Width
- Lower bounds for multicolor Ramsey numbers
- Data complexity measured by principal graphs
- On Graph Complexity
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- The landscape of communication complexity classes
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- Depth-based complexity traces of graphs
- On the CNF-complexity of bipartite graphs containing no squares
- MAX-plus objects to study the complexity of graphs
- Complexity aspects of the computation of the rank of a graph
- Graph complexity and slice functions
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Title not available (Why is that?)
- On the likelihood of forests
- The complexity of growing a graph
- The conjunctive complexity of quadratic Boolean functions
- On the extension complexity of polytopes separating subsets of the Boolean cube
- Comparison between the complexity of a function and the complexity of its graph
- The linear complexity of a graph
- Title not available (Why is that?)
- Computational complexity of graphs
This page was built for publication: Graph complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823693)
