Does the variable-matrix form of weak linear-programming duality have no polynomial-size proof in the Lovasz-Schrijver system, and do strongly polynomial circuits for linear…
Statement
Does the variable-matrix form of weak linear-programming duality have no polynomial-size proof in the Lovasz-Schrijver system, and do strongly polynomial circuits for linear programming exist?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.