scientific article; zbMATH DE number 7159878

DOI10.4086/cjtcs.2019.003zbMath1436.68395OpenAlexW4249531354MaRDI QIDQ5212563

Ishay Haviv, Michael Langberg

Publication date: 29 January 2020

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/cjtcs.2019.003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (1)

Local orthogonality dimension

Cites Work

• Unnamed Item
• Inequalities in Fourier analysis
• Removing randomness in parallel computation without a processor penalty
• Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
• Coloring 3-Colorable Graphs with Less than n ^1/5 Colors
• Conditional Hardness for Approximate Coloring
• On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• A fast parallel algorithm for the maximal independent set problem
• Constructing Small Sample Spaces Satisfying Given Constraints
• Simulating (log ^c n )-wise independence in NC
• Subquadratic zero-knowledge

This page was built for publication: