scientific article; zbMATH DE number 7471677
From MaRDI portal
Publication:5028438
Vojtěch Rödl, Navid Talebanfard, Michal Koucký
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2105.06744
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random CNF's are hard for the polynomial calculus
- Boolean function complexity. Advances and frontiers.
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis
- The isoperimetric number of random regular graphs
- Nearly perfect matchings in regular simple hypergraphs
- Strong ETH and resolution via games and the multiplicity of strategies
- A characterization of tree-like resolution size
- Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
- The Time Complexity of Constraint Satisfaction
- An improved exponential-time algorithm for k -SAT
- Set Partitioning via Inclusion-Exclusion
- Hard examples for resolution
- Short proofs are narrow—resolution made simple
- Proof Complexity
- 3-coloring in time
- Automating Resolution is NP-Hard
- Packing Paths in Steiner Triple Systems
- Algorithms – ESA 2005
- Strong ETH holds for regular resolution
This page was built for publication:
