On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability

DOI10.1016/j.ic.2017.11.002zbMath1380.68228MaRDI QIDQ1680511

Dimitrios M. Thilikos, Ge Xia, Iyad A. Kanj

Publication date: 16 November 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.11.002

zbMATH Keywords

genus; parameterized complexity; weighted satisfiability

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science