Computing and Combinatorics

DOI10.1007/11533719zbMath1128.68362OpenAlexW4376561447MaRDI QIDQ5717021

Xiuzhen Huang, Ge Xia, Jian'er Chen, Iyad A. Kanj

Publication date: 11 January 2006

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

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

On the Fine Grained Complexity of Finite Automata Non-emptiness of Intersection ⋮ Fixed-parameter approximation: conceptual framework and approximability results ⋮ Tight lower bounds for certain parameterized NP-hard problems

This page was built for publication: Computing and Combinatorics