Work

Proofs, Circuits, and Communication

Year: 2022

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2202.08909

Authors: de Rezende, Susanna F., Göös, Mika, Robere, Robert

Institutions: Lund University, École Polytechnique Fédérale de Lausanne, McGill University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Natural Sciences and Engineering Research Council of Canada

OpenAlex ID: W4225548342

Cites:

Cited by: 1

Related to: 10