ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let VBP\mathrm{VBP} be the class of polynomial families computable by polynomial-size algebraic branching programs, and let VNP\mathrm{VNP} be Valiant's class of polynomially verifiable families. The inclusions satisfy VBP⊆VNP\mathrm{VBP}\subseteq\mathrm{VNP}. Valiant's conjecture. We have

VBP≠VNP.\mathrm{VBP}\neq\mathrm{VNP}.

This is a central separation question in algebraic complexity theory; the source gives no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.