Problem packetResearch packetR1769
Strongest checked neighboring result
Link to a section
The record cites sources for its explanation.
Recorded status: reported
Recorded scope: No scope is recorded.
Originating problem: Strong Exponential Time Hypothesis
Authored record and scope
- Authored title
- Strongest checked neighboring result
- Record type
- claim
- Stored status
- reported
- Evidence grade
- sourced
2Authored explanation
Improved algorithms exist for every fixed k, and circuit lower bounds or restricted-model SAT lower bounds give partial evidence.
This leaves the following boundary unresolved: The unrestricted quantified lower bound remains unproved and undisproved. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.
Continue this work
Replay material: source only
3Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: doi.org ↗, R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and System Sciences 62 (2001). definition and consequences
4What was measured
5How it connects
Informs
- claim
Recorded for
- problem
Cite this record
Cite the original sources separately.
Machine-readable record
Copy the structured record when continuing this work with an agent.
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1769",
"content_hash": null,
"slug": "strong-exponential-time-hypothesis-claim-literature-frontier",
"type": "claim",
"title": "Strongest checked neighboring result",
"summary": "Improved algorithms exist for every fixed k, and circuit lower bounds or restricted-model SAT lower bounds give partial evidence.",
"relevance": "Locates the present research frontier immediately below Strong Exponential Time Hypothesis.",
"relevance_source": "recorded",
"body": "Improved algorithms exist for every fixed k, and circuit lower bounds or restricted-model SAT lower bounds give partial evidence.\n\nThis leaves the following boundary unresolved: The unrestricted quantified lower bound remains unproved and undisproved. The distinction is retained here so a restricted theorem, finite computation, or neighboring case is not presented as a solution of the full target.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://doi.org/10.1006/jcss.2000.1727",
"locator": "R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and System Sciences 62 (2001). definition and consequences"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://doi.org/10.1006/jcss.2000.1727",
"locator": "R. Impagliazzo and R. Paturi, On the complexity of k-SAT, Journal of Computer and System Sciences 62 (2001). definition and consequences"
},
"models": [],
"relations": [
{
"slug": "R1770",
"title": "Current status and exact unresolved remainder",
"object_type": "claim",
"relation": "informs",
"direction": "outgoing"
},
{
"slug": "strong-exponential-time-hypothesis",
"title": "strong exponential time hypothesis",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.