Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 155 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 20 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 86 tok/s Pro
Kimi K2 184 tok/s Pro
GPT OSS 120B 446 tok/s Pro
Claude Sonnet 4.5 31 tok/s Pro
2000 character limit reached

Quantified Derandomization of Linear Threshold Circuits (1709.07635v2)

Published 22 Sep 2017 in cs.CC

Abstract: One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing approach to prove such lower bounds is to construct a non-trivial derandomization algorithm for $TC0$. In this work we take a first step towards the latter goal, by proving the first positive results regarding the derandomization of $TC0$ circuits of depth $d>2$. Our first main result is a quantified derandomization algorithm for $TC0$ circuits with a super-linear number of wires. Specifically, we construct an algorithm that gets as input a $TC0$ circuit $C$ over $n$ input bits with depth $d$ and $n{1+\exp(-d)}$ wires, runs in almost-polynomial-time, and distinguishes between the case that $C$ rejects at most $2{n{1-1/5d}}$ inputs and the case that $C$ accepts at most $2{n{1-1/5d}}$ inputs. In fact, our algorithm works even when the circuit $C$ is a linear threshold circuit, rather than just a $TC0$ circuit (i.e., $C$ is a circuit with linear threshold gates, which are stronger than majority gates). Our second main result is that even a modest improvement of our quantified derandomization algorithm would yield a non-trivial algorithm for standard derandomization of all of $TC0$, and would consequently imply that $NEXP\not\subseteq TC0$. Specifically, if there exists a quantified derandomization algorithm that gets as input a $TC0$ circuit with depth $d$ and $n{1+O(1/d)}$ wires (rather than $n{1+\exp(-d)}$ wires), runs in time at most $2{n{\exp(-d)}}$, and distinguishes between the case that $C$ rejects at most $2{n{1-1/5d}}$ inputs and the case that $C$ accepts at most $2{n{1-1/5d}}$ inputs, then there exists an algorithm with running time $2{n{1-\Omega(1)}}$ for standard derandomization of $TC0$.

Citations (23)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.