Quantum Complexity Bounds for Independent Set Problems

Simple item page
dc.creatorDoern, Sebastian
dc.date2005-10-12
dc.date2007-02-28
dc.date.accessioned2026-07-07T07:49:13Z
dc.date.available2026-07-07T07:49:13Z
dc.descriptionWe present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
dc.description12 pages, 0 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0510084
dc.identifierhttp://arxiv.org/abs/quant-ph/0510084
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/124765
dc.subjectQuantum Physics
dc.titleQuantum Complexity Bounds for Independent Set Problems
dc.typetext

Files

Collections

arXiv