TheoremDB

Problem packetResearch packetR1801

R1801Sourced evidence

Strongest checked neighboring result

View evidenceOpen source ↗
Link to a section

Authored summary

Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Is VP equal to VNP?

Authored record and scope
Authored title
Strongest checked neighboring result
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller.

This leaves the following boundary unresolved: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known. 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

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: doi.org ↗, L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness

4What was measured

5How it connects

Informs

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1801",
  "content_hash": null,
  "slug": "vp-versus-vnp-claim-literature-frontier",
  "type": "claim",
  "title": "Strongest checked neighboring result",
  "summary": "Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller.",
  "relevance": "For Is VP equal to VNP?, record vp-versus-vnp-claim-literature-frontier (“Strongest checked neighboring result”) records a bound, answer, status fact, or structural consequence. The record states: Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller.",
  "relevance_source": "recorded",
  "body": "Exponential lower bounds are known for restricted arithmetic models, while unrestricted explicit lower bounds remain far smaller.\n\nThis leaves the following boundary unresolved: No superpolynomial lower bound for an explicit VNP family in general arithmetic circuits is known. 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.1145/800135.804419",
      "locator": "L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1145/800135.804419",
    "locator": "L. Valiant, Completeness classes in algebra, STOC 1979. VP, VNP, and permanent completeness"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1802",
      "title": "Current status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "informs",
      "direction": "outgoing"
    },
    {
      "slug": "vp-versus-vnp",
      "title": "vp versus vnp",
      "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.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.