Problem packetWorkR1411
[#R1411] Current status and exact unresolved remainder
claim. OPEN as checked on 2026-08-01. Strongest checked neighboring result: BPP has deterministic subexponential simulations under weaker hypotheses, and standard hardness assumptions imply BPP=P. Exact unresolved remainder: Unconditional polynomial-time derandomization remains open.
1Summary
The problem was checked as open on 2026-08-01.
The strongest neighboring result found in the cited sources is: BPP has deterministic subexponential simulations under weaker hypotheses, and standard hardness assumptions imply BPP=P.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits, STOC 1997. main theorem
3Overview
The exact unresolved remainder is: Unconditional polynomial-time derandomization remains open.
A complete resolution must meet the following acceptance conditions: - Give an unconditional deterministic polynomial-time simulation for every BPP machine. - Or prove a language in BPP lies outside P.
4What was measured
- As of
- 2026-08-01
- Exact open remainder
- Unconditional polynomial-time derandomization remains open.
5How it connects
Informed by
- claim
Evidenced by
- attempt
Addressed by
- attempt
Recorded for
- problem
6Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1411",
"content_hash": null,
"slug": "bpp-equals-p-claim-status-20260801",
"type": "claim",
"title": "Current status and exact unresolved remainder",
"summary": "OPEN as checked on 2026-08-01. Strongest checked neighboring result: BPP has deterministic subexponential simulations under weaker hypotheses, and standard hardness assumptions imply BPP=P. Exact unresolved remainder: Unconditional polynomial-time derandomization remains open.",
"relevance": "This is the dated publication status for the canonical target Is randomized polynomial time equal to deterministic polynomial time?.",
"relevance_source": "recorded",
"body": "The problem was checked as open on 2026-08-01.\n\nThe strongest neighboring result found in the cited sources is: BPP has deterministic subexponential simulations under weaker hypotheses, and standard hardness assumptions imply BPP=P.\n\nThe exact unresolved remainder is: Unconditional polynomial-time derandomization remains open.\n\nA complete resolution must meet the following acceptance conditions:\n- Give an unconditional deterministic polynomial-time simulation for every BPP machine.\n- Or prove a language in BPP lies outside P.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.1145/258533.258590",
"locator": "R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits, STOC 1997. main theorem"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1145/258533.258590",
"locator": "R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits, STOC 1997. main theorem"
},
"models": [],
"relations": [
{
"slug": "R1410",
"title": "Strongest checked neighboring result",
"object_type": "claim",
"relation": "informs",
"direction": "incoming"
},
{
"slug": "R1408",
"title": "Dated source and duplicate audit",
"object_type": "attempt",
"relation": "evidences",
"direction": "incoming"
},
{
"slug": "R1409",
"title": "Work at the unresolved boundary",
"object_type": "attempt",
"relation": "addresses",
"direction": "incoming"
},
{
"slug": "bpp-equals-p",
"title": "bpp equals p",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
- Project
- bpp-equals-p-release-300-source-review
- Locator
- R. Impagliazzo and A. Wigderson, P=BPP if E requires exponential circuits, STOC 1997. main theorem
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- doi.org ↗
- Public record
- R1411
- Stable alias
- bpp-equals-p-claim-status-20260801
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.