dc.contributor.author |
Garhofer, Simon |
|
dc.contributor.author |
Bringmann, Oliver |
|
dc.date.accessioned |
2025-07-14T08:43:20Z |
|
dc.date.available |
2025-07-14T08:43:20Z |
|
dc.date.issued |
2023 |
|
dc.identifier.issn |
1570-0755 |
|
dc.identifier.uri |
http://hdl.handle.net/10900/168068 |
|
dc.language.iso |
en |
de_DE |
dc.publisher |
New York : Springer |
de_DE |
dc.relation.uri |
http://dx.doi.org/10.1007/s11128-023-04115-w |
de_DE |
dc.subject.ddc |
530 |
de_DE |
dc.subject.ddc |
600 |
de_DE |
dc.title |
Using an A*-based framework for decomposing combinatorial optimization problems to employ NISQ computers |
de_DE |
dc.type |
Article |
de_DE |
utue.quellen.id |
20240124000000_01084 |
|
utue.personen.roh |
Garhofer, Simon |
|
utue.personen.roh |
Bringmann, Oliver |
|
dcterms.isPartOf.ZSTitelID |
Quantum Information Processing |
de_DE |
dcterms.isPartOf.ZS-Issue |
Article 357 |
de_DE |
dcterms.isPartOf.ZS-Volume |
22 (10) |
de_DE |
utue.fakultaet |
07 Mathematisch-Naturwissenschaftliche Fakultät |
de_DE |