Complexity of satisfiability problems with symmetric polynomial clauses

DOI10.1093/logcom/7.3.353zbMath0879.68054OpenAlexW2076477022MaRDI QIDQ4344698

Nadia Creignou, Malika More

Publication date: 12 January 1998

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/7.3.353

zbMATH Keywords

NP-complete problemsCNF-satisfiabilityproblem SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

This page was built for publication: Complexity of satisfiability problems with symmetric polynomial clauses