Small circuits and dual weak PHP in the universal theory of p-time algorithms

04/24/2020
by   Jan Krajicek, et al.
0

We prove, under a computational complexity hypothesis, that it is consistent with the true universal theory of p-time algorithms that a specific p-time function extending n bits to m ≥ n^2 bits violates the dual weak pigeonhole principle: every string y of length m equals to the value of the function for some x of length n. The function is the truth-table function assigning to a circuit the table of the function it computes and the hypothesis is that every language in P has circuits of a fixed polynomial size n^d.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2018

Small Hazard-free Transducers

Recently, an unconditional exponential separation between the hazard-fre...
research
06/25/2023

A Circuit Complexity Formulation of Algorithmic Information Theory

Inspired by Solomonoffs theory of inductive inference, we propose a prio...
research
09/07/2017

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem

Detecting patterns in strings and images is a fundamental and well studi...
research
03/16/2021

Computational power of one- and two-dimensional dual-unitary quantum circuits

Quantum circuits that are classically simulatable tell us when quantum c...
research
09/02/2020

Circuit Satisfiability Problem for circuits of small complexity

The following problem is considered. A Turing machine M, that accepts a ...
research
06/05/2021

Complexity of Modular Circuits

We study how the complexity of modular circuits computing AND depends on...
research
06/23/2019

Approximating Unitary Preparations of Orthogonal Black Box States

In this paper, I take a step toward answering the following question: fo...

Please sign up or login with your details

Forgot password? Click here to reset