search result

Cover von Diameter Versus Certificate Complexity of Boolean Functions

Diameter Versus Certificate Complexity of Boolean Functions

Year: 2021
Media group: LIPIcs
Cover von New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity

New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity

Year: 2018
Media group: LIPIcs
Cover von Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length

Year: 2011
Media group: ARTICLE
Cover von Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity

Nearly Tight Bounds on the Block Number of Boolean Functions in Terms of Sensitivity

Year: 2026
Media group: LIPIcs
Cover von Lower Bounds for (Non-Monotone) Comparator Circuits

Lower Bounds for (Non-Monotone) Comparator Circuits

Year: 2020
Media group: LIPIcs
Cover von Separations Above TFNP from Sherali-Adams Lower Bounds

Separations Above TFNP from Sherali-Adams Lower Bounds

Year: 2026
Media group: LIPIcs
Cover von Computational Complexity of Discrete Problems; 3
pp. 64-82
Search for this author
Year: 2019
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 3
Media group: DAGSTUHL REPORT
Cover von Cubic Formula Size Lower Bounds Based on Compositions with Majority

Cubic Formula Size Lower Bounds Based on Compositions with Majority

Year: 2018
Media group: LIPIcs
Cover von Optimal White-Box Adversarial Streaming Lower Bounds for Approximating LIS Length

Optimal White-Box Adversarial Streaming Lower Bounds for Approximating LIS Length

Year: 2026
Media group: LIPIcs
Cover von Computational Complexity of Discrete Problems; 3
pp. 17-31
Search for this author
Year: 2023
Publisher: Wadern, LZI
Dagstuhl Reports
Count: 3
Media group: DAGSTUHL REPORT
OPEN V 11.1.0.0