scientific article; zbMATH DE number 7378660

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.48MaRDI QIDQ5009544

Sajin Koroth, Or Meir

Publication date: 4 August 2021

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

zbMATH Keywords

compositioncircuit complexitycommunication complexityKRW conjecture

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

On derandomized composition of Boolean functions

Cites Work

• Communication complexity towards lower bounds on circuit depth
• Super-logarithmic depth lower bounds via the direct sum in communication complexity
• Applications of matrix methods to the theory of lower bounds in computational complexity
• Monotone Circuits for Connectivity Require Super-Logarithmic Depth
• Fractional Covers and Communication Complexity
• Toward better formula lower bounds
• Unnamed Item

This page was built for publication: