On semantic cutting planes with very small coefficients
type: Item
instance of: scholarly article
title: On semantic cutting planes with very small coefficients
zbMATH Open document ID: 1477.03248
author: Massimo Lauria
author: Neil Thapen
published in: Information Processing Letters
publication date: 2018-05-25T00:00:00Z
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6873291
zbMATH Keywords: theory of computation
zbMATH Keywords: proof complexity
zbMATH Keywords: cutting planes
Wikidata QID: Q61732570
MaRDI profile type: Publication
full work available at URL: j.ipl.2018.04.007
OpenAlex ID: W2797099466
cites work: Space Complexity in Propositional Calculus
cites work: A combinatorial characterization of resolution width
cites work: Space complexity of random formulae in resolution
cites work: Near optimal seperation of tree-like and general resolution
cites work: A characterization of tree-like resolution size
cites work: Pseudo-partitions, transversality and locality
cites work: Lower bounds for cutting planes proofs with small coefficients
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: On cutting-plane proofs in combinatorial optimization
cites work: The relative efficiency of propositional proof systems
cites work: On the complexity of cutting-plane proofs
cites work: A machine program for theorem-proving
cites work: A Computing Procedure for Quantification Theory
cites work: Space bounds for resolution
cites work: Semantic Versus Syntactic Cutting Planes
cites work: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
cites work: From small space to small width in resolution
cites work: Space Complexity in Polynomial Calculus
cites work: Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes
cites work: The Pebbling Problem is Complete in Polynomial Space
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: A note on monotone real circuits
cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
cites work: Pebble games, proof complexity, and time-space trade-offs
cites work: Lower bounds for resolution and cutting plane proofs and monotone computations
cites work: Q4601841
DOI: 10.1016/J.IPL.2018.04.007
description: scientific article; zbMATH DE number 6873291