Lower Bounds for Splittings by Linear Combinations
From MaRDI portal
Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Recommendations
- Tight upper bound on splitting by linear combinations for pigeonhole principle
- scientific article; zbMATH DE number 4172392
- A lower-bound of a multiplicative combination approximation
- Lower bounds on t(n, k) from linear inequalities
- Hard satisfiable formulas for splittings by linear combinations
- scientific article; zbMATH DE number 1539327
- The combinatorics of the splitting theorem
- A combinatorial bound for linear programming and related problems
- The combinatorics of splittability
- scientific article; zbMATH DE number 3999287
Cited in
(11)- Hard satisfiable formulas for splittings by linear combinations
- On conversions from CNF to ANF
- Notes on resolution over linear equations
- Resolution over linear equations modulo two
- Tight upper bound on splitting by linear combinations for pigeonhole principle
- Randomized feasible interpolation and monotone circuits with a local oracle
- New Computational Paradigms
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- Exponential separation between powers of regular and general resolution over parities
- Lower bounds for regular resolution over parities
- Resolution over linear equations and multilinear proofs
This page was built for publication: Lower Bounds for Splittings by Linear Combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922623)
