Lower Bounds for Splittings by Linear Combinations

DOI10.1007/978-3-662-44465-8_32zbMath1427.68123OpenAlexW2158162347MaRDI QIDQ2922623

Dmitry Sokolov, Dmitry Itsykson

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_32

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (4)

Randomized feasible interpolation and monotone circuits with a local oracle ⋮ Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle ⋮ On conversions from CNF to ANF ⋮ Resolution over linear equations modulo two

This page was built for publication: Lower Bounds for Splittings by Linear Combinations