On depth-3 circuits and covering number: an explicit counter-example

10/15/2022

∙

We give a simple construction of n× n Boolean matrices with Ω(n^4/3) zero entries that are free of 2 × 2 all-zero submatrices and have covering number O(log^4(n)). This construction provides an explicit counterexample to a conjecture of Pudlák, Rödl and Savický and Research Problems 1.33, 4.9, 11.17 of Jukna [Boolean function complexity]. These conjectures were previously refuted by Katz using a probabilistic construction.

READ FULL TEXT

On depth-3 circuits and covering number: an explicit counter-example

Characteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

Explicit Model Construction for Saturated Constrained Horn Clauses

The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

Improved efficiency for explicit covering codes matching the sphere-covering bound

A remark on covering

A general framework for secondary constructions of bent and plateaued functions

On depth-3 circuits and covering number: an explicit counter-example

Related Research

Characteristic matrix of covering and its application to boolean matrix decomposition and axiomatization

Explicit Model Construction for Saturated Constrained Horn Clauses

The Courtade-Kumar Most Informative Boolean Function Conjecture and a Symmetrized Li-Médard Conjecture are Equivalent

A counter-example to the probabilistic universal graph conjecture via randomized communication complexity

Improved efficiency for explicit covering codes matching the sphere-covering bound

A remark on covering

A general framework for secondary constructions of bent and plateaued functions