Parameterized and Exact Computation

DOI10.1007/b100584zbMath1104.68843OpenAlexW2475962691MaRDI QIDQ5311517

S. S. Fedin, Alexander S. Kulikov

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100584

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A new upper bound for \(( n , 3)\)-MAX-SAT

This page was built for publication: Parameterized and Exact Computation