The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter

DOI10.1007/978-3-642-29700-7_20zbMath1304.68085OpenAlexW160705700MaRDI QIDQ2897996

Junping Zhou, Minghao Yin

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_20

zbMATH Keywords

upper boundworst caseX3SATconnected-clauses principle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

This page was built for publication: The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter