- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Fixed points of the subset sum pseudorandom number generators ; volume:91 ; number:7 ; day:23 ; month:3 ; year:2023 ; pages:2473-2479 ; date:7.2023
Designs, codes and cryptography ; 91, Heft 7 (23.3.2023), 2473-2479, 7.2023
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10623-023-01209-5
- URN
-
urn:nbn:de:101:1-2023091914145797224012
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:55 MESZ
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
- Šparlinskij, Igor E.
- SpringerLink (Online service)
Ähnliche Objekte (12)
The subset sum game revisited
The subset sum game revisited
The subset sum game revisited
Improved low-density subset sum algorithms
Combinatorial algorithms for subset sum problems
Approximating subset sum ratio via partition computations
Faster algorithms for k-subset sum and variations
RESULTS ON FIXED POINTS
Vector-valued metrics, fixed points and coupled fixed points for nonlinear operators
Solutions for subset sum problems with special digraph constraints
Fixed Points and Common Fixed Points for Orbit-Nonexpansive Mappings in Metric Spaces
Iterative approximation of fixed points
The subset sum game revisited
The subset sum game revisited
The subset sum game revisited
Improved low-density subset sum algorithms
Combinatorial algorithms for subset sum problems
Approximating subset sum ratio via partition computations
Faster algorithms for k-subset sum and variations
RESULTS ON FIXED POINTS
Vector-valued metrics, fixed points and coupled fixed points for nonlinear operators
Solutions for subset sum problems with special digraph constraints
Fixed Points and Common Fixed Points for Orbit-Nonexpansive Mappings in Metric Spaces
Iterative approximation of fixed points
The subset sum game revisited
The subset sum game revisited
The subset sum game revisited
Improved low-density subset sum algorithms
Combinatorial algorithms for subset sum problems
Approximating subset sum ratio via partition computations
Faster algorithms for k-subset sum and variations
RESULTS ON FIXED POINTS
Vector-valued metrics, fixed points and coupled fixed points for nonlinear operators
Solutions for subset sum problems with special digraph constraints
Fixed Points and Common Fixed Points for Orbit-Nonexpansive Mappings in Metric Spaces