- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Theory of computing systems, Band 65, Ausgabe 5, Seite 884-900, 2021
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2023
- Urheber
- DOI
-
10.1007/s00224-021-10034-z
- URN
-
urn:nbn:de:kobv:11-110-18452/27170-4
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Pieterse, Astrid
- Woeginger, Gerhard J.
- Humboldt-Universität zu Berlin
Entstanden
- 2023
Ähnliche Objekte (12)
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Solutions for subset sum problems with special digraph constraints
The alpha-constant-sum games
Quantum algorithms for subset sum under different quantum memory models
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
The non-constant-sum Colonel Blotto game
Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications
Zero-Sum Games in Social Choice and Game Theory
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Solutions for subset sum problems with special digraph constraints
The alpha-constant-sum games
Quantum algorithms for subset sum under different quantum memory models
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
The non-constant-sum Colonel Blotto game
Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications
Zero-Sum Games in Social Choice and Game Theory
The subset sum game revisited
Combinatorial algorithms for subset sum problems
Improved low-density subset sum algorithms
The Elser nuclei sum revisited
Solutions for subset sum problems with special digraph constraints
The alpha-constant-sum games
Quantum algorithms for subset sum under different quantum memory models
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
The non-constant-sum Colonel Blotto game
Memory-efficient algorithms for solving subset sum and related problems with cryptanalytic applications