跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.11966 · v1

On Non-Deterministic Representation of Boolean Functions

首次提交 2026-11-09 14:44
版本更新 2026-11-09 14:44
雷达观测 2026-11-10 13:18
arXiv ↗PDF ↗

摘要

We study non-deterministic representation of Boolean functions by polynomials, introduced by (de Wolf, 2000). A polynomial p(x)p(x) is said to be a non-deterministic polynomial for a Boolean function ff if for all a∈{0,1}na\in\{0,1\}^n, p(a)≠0p(a)\neq 0 iff f(a)=1f(a)=1. The non-deterministic degree of ff, denoted ndeg(f)\mathsf{ndeg}(f), is the minimal degree of a non-deterministic polynomial for ff. In this work, we show the following main results: - Almost all Boolean functions on nn variables have non-deterministic degree at most n/2+O(nlog⁡n)n/2 + O(\sqrt{n\log n}). This confirms a conjecture of (Iyer et al., 2023). Together with the lower bound of (Iyer et al., 2023) it establishes a tight bound on the rational degree of a random Boolean function up to lower order terms. - We disprove a conjecture of (Kothari et al., 2026) about effective hypercube nullstellensatz for more than two polynomials. On the positive side, we also identify a constraint under which an effective hypercube nullstellensatz holds for many polynomials.

作者备注:15 pages, to appear in FSTTCS 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-09 14:44 · 最新观测版本

On Non-Deterministic Representation of Boolean Functions

We study non-deterministic representation of Boolean functions by polynomials, introduced by (de Wolf, 2000). A polynomial p(x)p(x) is said to be a non-deterministic polynomial for a Boolean function ff if for all a∈{0,1}na\in\{0,1\}^n, p(a)≠0p(a)\neq 0 iff f(a)=1f(a)=1. The non-deterministic degree of ff, denoted ndeg(f)\mathsf{ndeg}(f), is the minimal degree of a non-deterministic polynomial for ff. In this work, we show the following main results: - Almost all Boolean functions on nn variables have non-deterministic degree at most n/2+O(nlog⁡n)n/2 + O(\sqrt{n\log n}). This confirms a conjecture of (Iyer et al., 2023). Together with the lower bound of (Iyer et al., 2023) it establishes a tight bound on the rational degree of a random Boolean function up to lower order terms. - We disprove a conjecture of (Kothari et al., 2026) about effective hypercube nullstellensatz for more than two polynomials. On the positive side, we also identify a constraint under which an effective hypercube nullstellensatz holds for many polynomials.

查看此版本解读 →查看此版本原文 ↗