scientific article; zbMATH DE number 7204254
From MaRDI portal
Publication:5111133
DOI10.4230/LIPIcs.CCC.2017.3zbMath1440.68078MaRDI QIDQ5111133
Pavel Pudlák, Mateus de Oliveira Oliveira
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundsfeasible interpolationLovász-Schrijver proof systemcutting-planes proof systemmonotone linear programming circuits
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (1)
This page was built for publication:
