Algorithms and Computation

DOI10.1007/11602613zbMath1175.68194OpenAlexW2304246803MaRDI QIDQ5897895

Marek Karpinski, Cristina Bazgan

Publication date: 14 November 2006

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint ⋮ A bounded-error quantum polynomial-time algorithm for two graph bisection problems

This page was built for publication: Algorithms and Computation