- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: 10.1007/s00224-021-10034-z
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2021
- Creator
- DOI
-
10.18154/RWTH-2021-02458
- URN
-
urn:nbn:de:101:1-2021032310503506475929
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:36 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Pieterse, Astrid
- Woeginger, Gerhard J.
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2021
Other Objects (12)
The subset sum game revisited
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Approximating subset sum ratio via partition computations
Fixed points of the subset sum pseudorandom number generators
Faster algorithms for k-subset sum and variations
The alpha-constant-sum games
Solutions for subset sum problems with special digraph constraints
Quantum algorithms for subset sum under different quantum memory models
The non-constant-sum Colonel Blotto game
The subset sum game revisited
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Approximating subset sum ratio via partition computations
Fixed points of the subset sum pseudorandom number generators
Faster algorithms for k-subset sum and variations
The alpha-constant-sum games
Solutions for subset sum problems with special digraph constraints
Quantum algorithms for subset sum under different quantum memory models
The non-constant-sum Colonel Blotto game
The subset sum game revisited
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Approximating subset sum ratio via partition computations
Fixed points of the subset sum pseudorandom number generators
Faster algorithms for k-subset sum and variations
The alpha-constant-sum games
Solutions for subset sum problems with special digraph constraints
Quantum algorithms for subset sum under different quantum memory models