Publication:4737194

zbMath1057.68646MaRDI QIDQ4737194

Marek Karpinski, Piotr Berman

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800623.htm

Mathematics Subject Classification ID

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

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

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

Related Items

The inapproximability of lattice and coding problems with preprocessing