Monotone Circuit Lower Bounds from Robust Sunflowers

Bruno Pasqualotto Cavalar; Mrinal Kumar; Benjamin Rossman

doi:10.48550/arxiv.2012.03883

ScienceGate Book Chapters

JOURNAL ARTICLE

Monotone Circuit Lower Bounds from Robust Sunflowers

Bruno Pasqualotto Cavalar Mrinal Kumar Benjamin Rossman

Year: 2020 Journal: Lecture notes in computer science Vol: 27 Pages: 311-322 Publisher: Springer Science+Business Media

DOI: 10.48550/arxiv.2012.03883

Get Full-Text PDF Get Analytical Report

Keywords:

Monotone polygon Clique Combinatorics Upper and lower bounds Mathematics Conjecture Discrete mathematics Function (biology) Generalization Boolean function

Metrics

Cited By

0.57

FWCI (Field Weighted Citation Impact)

Refs

0.71

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Machine Learning and Algorithms

Physical Sciences → Computer Science → Artificial Intelligence

Benford’s Law and Fraud Detection

Physical Sciences → Mathematics → Statistics and Probability

Monotone Circuit Lower Bounds from Robust Sunflowers

Metrics

Citation History

Topics

Related Documents

Monotone Circuit Lower Bounds from Robust Sunflowers

Monotone circuit lower bounds from resolution

Symmetric approximation arguments for monotone lower bounds without sunflowers

Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

Monotone Depth Lower Bounds