AI Chat AI Image Generator AI Video Text to Speech

Proofs, Circuits, and Communication

02/17/2022

∙

by Susanna F. de Rezende, et al.

∙

∙

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search problems (TFNP) as a unifying language for these connections and discuss how this perspective suggests a whole programme for further research.

Susanna F. de Rezende
6 publications
Mika Göös
14 publications
Robert Robere
9 publications

research

∙ 11/04/2018

Some Results on the Circuit Complexity of Bounded Width Circuits and Nondeterministic Circuits

In this paper, we consider bounded width circuits and nondeterministic c...

0 Hiroki Morizumi, et al. ∙

research

∙ 05/01/2022

Enumeration Classes Defined by Circuits

We refine the complexity landscape for enumeration problems by introduci...

0 Nadia Creignou, et al. ∙

research

∙ 10/28/2019

On the Degree of Boolean Functions as Polynomials over Z_m

Polynomial representations of Boolean functions over various rings such ...

0 Xiaoming Sun, et al. ∙

research

∙ 01/03/2018

Computational complexity lower bounds of certain discrete Radon transform approximations

For the computational model where only additions are allowed, the Ω(n^2 ...

0 Timur M. Khanipov, et al. ∙

research

∙ 06/24/2022

Arithmetic Circuits, Structured Matrices and (not so) Deep Learning

This survey presents a necessarily incomplete (and biased) overview of r...

0 Atri Rudra, et al. ∙

research

∙ 11/16/2018

PRAMs over integers do not compute maxflow efficiently

Finding lower bounds in complexity theory has proven to be an extremely ...

0 Luc Pellissier, et al. ∙

research

∙ 10/12/2011

The Language of Search

This paper is concerned with a class of algorithms that perform exhausti...

0 A. Darwiche, et al. ∙