Graph complexity
From MaRDI portal
Publication:1823693
zbMath0681.68070MaRDI QIDQ1823693
Petr Savický, Pavel Pudlák, Vojtěch Rödl
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
Related Items (14)
On the likelihood of forests ⋮ The landscape of communication complexity classes ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Monoidal Width ⋮ On the CNF-complexity of bipartite graphs containing no squares ⋮ Depth-based complexity traces of graphs ⋮ Monoidal Width: Capturing Rank Width ⋮ On the extension complexity of polytopes separating subsets of the Boolean cube ⋮ Lower bounds for multicolor Ramsey numbers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithms and lower bounds for de morgan formulas of low-communication leaf gates ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ The conjunctive complexity of quadratic Boolean functions
This page was built for publication: Graph complexity
