scientific article; zbMATH DE number 7204537

DOI10.4230/LIPIcs.ICALP.2017.85zbMath1441.68238arXiv1611.01291MaRDI QIDQ5111416

Navid Talebanfard, Pavel Pudlák, Dominik Scheder

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1611.01291

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

resolutionstrong exponential time hypothesis\(k\)-SATPPSZ

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Computational aspects of satisfiability (68R07)

Related Items (2)

Super strong ETH is true for PPSZ with small resolution width ⋮ On Super Strong ETH

This page was built for publication: