theoremnovel
Deterministic approximation of acceptance probability
Approximates acceptance probability within in space
precision-parameter form of the fixed-precision theorem
Theorem·
thm:probability·§1 IntroductionStatement (paper)
Fix a randomized machine with polynomial worst-case
running time and work space. Let be
its acceptance probability on an input of length . There is a
uniform deterministic algorithm which, on input with ,
outputs an integer satisfying
It uses work space and
time. The constants depend only on .
In plain English
For a fixed randomized machine with polynomial running time and work space, a deterministic algorithm given outputs an integer with such that is within of the acceptance probability . It runs in work space and time.
Why it's here
This is the probability-estimation form of the main result: it gives deterministic approximation of acceptance probabilities to accuracy in logarithmic space when , which is what yields the exact derandomization of logarithmic space. It extends the fixed inverse-polynomial accuracy result (Theorem 12.1) to a precision parameter given in unary, with space growing only additively in .
Classified novel:
This is the paper's headline probability-estimation form of L = BPL, which is open in prior work: the best earlier deterministic simulations (Saks–Zhou, Hoza) use about log^{3/2} n space. The extension from fixed inverse-polynomial accuracy (Theorem 12.1) to precision 2^{-q} with only additive O(q) space is a main claimed contribution, not a known result.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §1 Introduction
- Page
- —
- Label
thm:probability- Line
sections/introduction.tex:40
Leannot aligned
Phase 2 aligns this node to a Lean declaration.