arXiv 1706.046412017-06-14cs.CC

Pseudo-deterministic Proofs

Shafi Goldwasser, Ofer Grossman, Dhiraj Holden

英文摘要：

We introduce pseudo-deterministic interactive proofs (psdAM): interactive proof systems for search problems where the verifier is guaranteed with high probability to output the same output on different executions. As in the case with classical interactive proofs, the verifier is a probabilistic polynomial time algorithm interacting with an untrusted powerful prover. We view pseudo-deterministic interactive proofs as an extension of the study of pseudo-deterministic randomized polynomial time algorithms: the goal of the latter is to find canonical solutions to search problems whereas the goal of the former is to prove that a solution to a search problem is canonical to a probabilistic polynomial time verifier. Alternatively, one may think of the powerful prover as aiding the probabilistic polynomial time verifier to find canonical solutions to search problems, with high probability over the randomness of the verifier. The challenge is that pseudo-determinism should hold not only with respect to the randomness, but also with respect to the prover: a malicious prover should not be able to cause the verifier to output a solution other than the unique canonical one.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Doubly-Efficient Pseudo-Deterministic Proofs

In [20] Goldwasser, Grossman and Holden introduced pseudo-deterministic interactive proofs for search problems where a powerful prover can convince a probabilistic polynomial time verifier that a solution to a search problem is canonical. They studied search problems for which polynomial time algorithms are not known and for which many solutions are possible. They showed that whereas there exists a constant round pseudo deterministic proof for graph isomorphism where the canonical solution is the lexicographically smallest isomorphism, the existence of pseudo-deterministic interactive proofs f…

2020-04-26cs.CC

A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems

We show the first unconditional pseudo-determinism result for all of search-BPP. Specifically, we show that every BPP search problem can be computed pseudo-deterministically on average for infinitely many input lengths. In other words, for infinitely many input lengths and for any polynomial-time samplable distribution our algorithm succeeds in producing a unique answer (if one exists) with high probability over the distribution and the coins tossed.

2017-07-18cs.CC

伪确定性量子算法

Pseudo-deterministic Quantum Algorithms

University of Cambridge（剑桥大学）；UT Austin（德克萨斯大学奥斯汀分校）

研究提出伪确定性量子算法，展示其在查询复杂度上的分离结果，并识别可实现伪确定性的量子搜索问题类。

2026-02-19cs.CCquant-ph

Pseudo-deterministic Streaming

A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions. Classic streaming algorithms, such as those for finding heavy hitters, approximate counting, $\ell_2$ approximation, finding a nonzero entry in a vector (for turnstile algorithms) are not pseudo-deterministic. For example, in the instance of finding a nonzero entry in a vector, for any known low-space algorithm $A$, there exists a stream $x$ so that running $A$ twice on $x$ (using different randomness) would with high pr…

2019-11-26cs.CCcs.DS

伪确定性近似计数的紧空间下界

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting

该研究针对流算法中的近似计数问题，分析其伪确定性复杂度，证明了紧的Ω(log N)空间下界，解决了Goldwasser等人提出的相关问题，补充了伪确定性流算法的空间复杂度理论。

2024-10-05cs.CCcs.DS

有限域上不可约多项式的伪确定性构造

Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields

本研究扩展Shoup的确定性算法，通过结合快速随机因式分解算法，提出了一种运行时间为$\tilde{O}(d^4 \u2009\text{log}^4 q)$的多项式时间伪确定性算法，用于构造有限域上的不可约多项式。

2024-10-05cs.CCcs.DSmath.NT

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

Reproducibility and Pseudo-Determinism in Log-Space

A curious property of randomized log-space search algorithms is that their outputs are often longer than their workspace. This leads to the question: how can we reproduce the results of a randomized log space computation without storing the output or randomness verbatim? Running the algorithm again with new random bits may result in a new (and potentially different) output. We show that every problem in search-RL has a randomized log-space algorithm where the output can be reproduced. Specifically, we show that for every problem in search-RL, there are a pair of log-space randomized algorithms…

2018-03-11cs.CC

About the impossibility to prove P=NP and the pseudo-randomness in NP

The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic" nature of a problem, and more specifically at the temporal nature of the complexity within the NP class of problems. Let us remind that the NP class is called the class of "Non Deterministic Polynomial" languages. Using the meta argument that results in Mathematics should be "time independent" as they are reproducible, the paper shows that the P!=NP asserti…

2016-03-24cs.CC

Proof complexity of systems of (non-deterministic) decision trees and branching programs

This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs - deterministic and nondeterministic. The systems LDT and LNDT are propositional proof systems in which lines represent deterministic or non-deterministic decision trees. Branching programs are modeled as decision dags. Adding extension to LDT and LNDT gives systems eLDT and eLNDT in which lines represent deterministic and non-deterministic branching programs, respectively. Deterministic and non-deterministic branching programs correspond to log-space (L) and nondeterministic log-…

2019-10-18cs.CCcs.LOmath.LO

PSPACE-Completeness of Reversible Deterministic Systems

We prove PSPACE-completeness of several reversible, fully deterministic systems. At the core, we develop a framework for such proofs (building on a result of Tsukiji and Hagiwara and a framework for motion planning through gadgets), showing that any system that can implement three basic gadgets is PSPACE-complete. We then apply this framework to four different systems, showing its versatility. First, we prove that Deterministic Constraint Logic is PSPACE-complete, fixing an error in a previous argument from 2008. Second, we give a new PSPACE-hardness proof for the reversible `billiard ball' mo…

2022-07-14cs.CC

最小割问题的伪确定性算法

Pseudodeterministic Algorithms for Minimum Cut Problems

Max-Planck-Institut für Informatik（马克斯·普朗克 informatics 研究所）；Saarland Informatics Campus（萨尔兰 informatics 校园）；University of Cologne（科隆大学）

本文提出了一种高效的伪确定性算法，用于解决全局最小割和最小s-t割问题，并在多种计算模型中实现了该算法。

2025-12-29cs.CCcs.DS

利用Kolmogorov复杂性强分离确定性时间和非确定性时间的Oracle

An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity

Hartmanis使用Kolmogorov复杂性为Baker、Gill和Solovay的经典结果提供了另一种证明，即存在一个相对于P不是NP的预言。我们完善的技术，以加强结果，构建一个预言相对于一个猜想的利普顿是假的。

2010-04-22cs.CC

Deterministic search for CNF satisfying assignments in almost polynomial time

We consider the fundamental derandomization problem of deterministically finding a satisfying assignment to a CNF formula that has many satisfying assignments. We give a deterministic algorithm which, given an $n$-variable $\mathrm{poly}(n)$-clause CNF formula $F$ that has at least $\varepsilon 2^n$ satisfying assignments, runs in time \[ n^{\tilde{O}(\log\log n)^2} \] for $\varepsilon \ge 1/\mathrm{polylog}(n)$ and outputs a satisfying assignment of $F$. Prior to our work the fastest known algorithm for this problem was simply to enumerate over all seeds of a pseudorandom generator for CNFs; …

2018-01-10cs.CC

Prover-Adversary 博弈在（非确定性）分支程序系统上的应用

Prover-Adversary games for systems over (non-deterministic) branching programs

University of Birmingham（伯明翰大学）

本文引入 Pudlak-Buss 风格的 Prover-Adversary 博弈来刻画确定性分支程序（BP）和非确定性分支程序（NBP）上的证明系统，并证明了这些证明系统与对应博弈之间的多项式等价性，同时基于此技术得到了 Immerman-Szelepcsenyi 定理的证明复杂性版本。

2026-05-19cs.CCcs.LOmath.LO

An Improved Pseudo-Polynomial Upper Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games

In this work we offer an $O(|V|^2 |E|\, W)$ pseudo-polynomial time deterministic algorithm for solving the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games. This improves by a factor $\log(|V|\, W)$ the best previously known pseudo-polynomial time upper bound due to Brim,~\etal The improvement hinges on a suitable characterization of values, and a description of optimal positional strategies, in terms of reweighted Energy Games and Small Energy-Progress Measures.

2016-04-24cs.CCcs.DScs.GT

Computing Igusa's local zeta function of univariates in deterministic polynomial-time

Igusa's local zeta function $Z_{f,p}(s)$ is the generating function that counts the number of integral roots, $N_{k}(f)$, of $f(\mathbf x) \bmod p^k$, for all $k$. It is a famous result, in analytic number theory, that $Z_{f,p}$ is a rational function in $\mathbb{Q}(p^s)$. We give an elementary proof of this fact for a univariate polynomial $f$. Our proof is constructive as it gives a closed-form expression for the number of roots $N_{k}(f)$. Our proof, when combined with the recent root-counting algorithm of (Dwivedi, Mittal, Saxena, CCC, 2019), yields the first deterministic poly($|f|, \log …

2020-06-16cs.CCcs.DScs.SC

迈向常数深度电路的常数深度因子的确定性算法

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits

本文提出确定性次指数时间算法，利用伪结式及相关去随机化结果，枚举常数深度电路可计算的多元多项式不可约因子。

2024-03-04cs.CCcs.DS