arXiv cs/03040402003-04-28cs.CC

Hardness as randomness: a survey of universal derandomization

Russell Impagliazzo

发表信息：: Proceedings of the ICM, Beijing 2002, vol. 3, 659--672

英文摘要：

We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that $P=BPP$, it also indicates that this may be a difficult question to resolve. In fact, proving that probabilistic algorithms have non-trivial deterministic simulations is basically equivalent to proving circuit lower bounds, either in the algebraic or Boolean models.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

对数空间去随机化的泄露弹性难度等价

Leakage-Resilient Hardness Equivalence to Logspace Derandomization

本文借助类似Liu和Pass的技术，证明了“泄露弹性难度”假设与prBP·L去随机化及寻找承诺搜索问题“非否”实例之间存在等价性。

2024-06-27cs.CC

关于“极高端”伪随机生成器与快速去随机化所需的硬度假设

On Hardness Assumptions Needed for "Extreme High-End'' PRGs and Fast Derandomization

研究在“极高端硬度假设”下能否构造极高端伪随机生成器，指出某些方法无法产生黑盒证明。

2023-11-20cs.CC

Derandomization from Algebraic Hardness

A hitting-set generator (HSG) is a polynomial map $G:\mathbb{F}^k \to \mathbb{F}^n$ such that for all $n$-variate polynomials $C$ of small enough circuit size and degree, if $C$ is nonzero, then $C\circ G$ is nonzero. In this paper, we give a new construction of such an HSG assuming that we have an explicit polynomial of sufficient hardness. Formally, we prove the following over any field of characteristic zero: Let $k\in \mathbb{N}$ and $δ> 0$ be arbitrary constants. Suppose $\{P_d\}_{d\in \mathbb{N}}$ is an explicit family of $k$-variate polynomials such that $\operatorname{deg} P_d = d$ and…

2020-06-26cs.CCcs.SC

差分隐私计数查询的高效去随机化

Efficient derandomization of differentially private counting queries

针对差分隐私d个计数查询所需随机比特过多的问题，本文提出一种不依赖舍入方案的多项式时间机制，利用随机移位后许多查询答案对噪声不敏感的特性，实现了接近已有工作的随机性复杂度与准确性权衡。

2025-10-21cs.CCcs.CR

$\exists\mathbb{R}$-完备性与超行列式的一种去随机化障碍

$\exists\mathbb{R}$-Completeness of Tensor Degeneracy and a Derandomization Barrier for Hyperdeterminants

研究多线性映射的奇异性和超行列式的计算复杂性，证明张量退化在$\exists\mathbb{R}$理论中是完备的，并指出超行列式消失的确定性复杂性与代数复杂性中的去随机化问题相关。

2026-04-18cs.CC

Algebraic Hardness versus Randomness in Low Characteristic

We show that lower bounds for explicit constant-variate polynomials over fields of characteristic $p > 0$ are sufficient to derandomize polynomial identity testing over fields of characteristic $p$. In this setting, existing work on hardness-randomness tradeoffs for polynomial identity testing requires either the characteristic to be sufficiently large or the notion of hardness to be stronger than the standard syntactic notion of hardness used in algebraic complexity. Our results make no restriction on the characteristic of the field and use standard notions of hardness. We do this by combinin…

2020-05-21cs.CC

更多相关论文收起更多论文

Optimal epsilon-biased sets with just a little randomness

Subsets of F_2^n that are eps-biased, meaning that the parity of any set of bits is even or odd with probability eps close to 1/2, are powerful tools for derandomization. A simple randomized construction shows that such sets exist of size O(n/eps^2), and known deterministic constructions achieve sets of size O(n/eps^3), O(n^2/eps^2), and O((n/eps^2)^{5/4}). Rather than derandomizing these sets completely in exchange for making them larger, we attempt a partial derandomization while keeping them small, constructing sets of size O(n/eps^2) with as few random bits as possible. The naive randomize…

2013-04-18cs.CCmath.CO

Hardness of Ruling Out Short Proofs of Kolmogorov Randomness

A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), asserts the hardness of ruling out length $t$ proofs that string $x$ is Kolmogorov random (e.g. $x{\in}R$), by analogy to Chaitin's result that proving $x{\in}R$ is typically impossible. By assertion, efficiently ruling out short proofs requires, impossibly, ruling out any proof. FCI has strong implications: (i) randomly chosen $x$ typically yields tautologies hard with high probability for any given proof system, densely witnessing its nonoptimality; (ii) average-case impossibility of proving $x{\in}R$ implies average-case h…

2023-03-16cs.CCmath.LO

硬度作为信息约束：一个统一的元复杂性假设

Hardness Conjectures as Information Constraints: Does Complexity Theory Need New Axioms?

本文提出Kolmogorov硬度（KH）假设，将计算复杂性中的开放问题重新表述为关于Kolmogorov随机串的信息约束，并展示其统一解释多种复杂性现象的能力。

2026-07-21cs.CC

Certified Hardness vs. Randomness for Log-Space

Let $\mathcal{L}$ be a language that can be decided in linear space and let $ε>0$ be any constant. Let $\mathcal{A}$ be the exponential hardness assumption that for every $n$, membership in $\mathcal{L}$ for inputs of length~$n$ cannot be decided by circuits of size smaller than $2^{εn}$. We prove that for every function $f :\{0,1\}^* \rightarrow \{0,1\}$, computable by a randomized logspace algorithm $R$, there exists a deterministic logspace algorithm $D$ (attempting to compute $f$), such that on every input $x$ of length $n$, the algorithm $D$ outputs one of the following: 1: The correct va…

2023-03-29cs.CCcs.DS

概率计算机（因此量子计算机）比传统计算机更严格强大，以及去随机化

Probabilistic Computers (and Hence Quantum Computers) Are Rigorously More Powerful Than Classical Deterministic Computers, and Derandomization

Hakka University（客家大学）

本文通过构造一个在时间O(n^k)内运行的概率图灵机接受语言L_d，证明L_d属于BPP但不在P中，从而分离BPP与P，并进而确认量子计算机严格强于传统计算机，同时否定扩展丘奇-图灵论题。

2026-07-19cs.CCmath.PR

范围规避问题的难度与证明复杂性生成器的难度

Hardness of Range Avoidance and Proof Complexity Generators from Demi-Bits

Institute for Advanced Study（高等研究院）；University of California, Berkeley（加州大学伯克利分校）；Johns Hopkins University（约翰斯·霍普金斯大学）

本文研究了范围规避问题的难度及其与证明复杂性生成器的关系，证明了demi-bits生成器的存在可使Avoid问题对非确定性算法困难，并分离了两种证明理论。

2026-03-13cs.CCcs.CR

(P3, H)-Arrowing 问题的复杂性及其延伸

The Complexity of (P3, H)-Arrowing and Beyond

本文研究(P3,H)-Arrowing问题的复杂性，证明除H=K3外所有2-连通H均coNP-完全，并引入新图不变量将困难性扩展到一般(F,H)-Arrowing问题。

2024-07-21cs.CC