Fixed points of the subset sum pseudorandom number generators

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource, 1 online resource.

Language: Englisch

Bibliographic citation: 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

Creator: Šparlinskij, Igor E.

Contributor: SpringerLink (Online service)

DOI: 10.1007/s10623-023-01209-5

URN: urn:nbn:de:101:1-2023091914145797224012

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:55 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Šparlinskij, Igor E.
SpringerLink (Online service)

Other Objects (12)

The subset sum game revisited

Improved low-density subset sum algorithms

Hochschulschrift

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

Artikel

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

Improved low-density subset sum algorithms

Hochschulschrift

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

Artikel

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

Improved low-density subset sum algorithms

Hochschulschrift

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

Artikel

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

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Fixed points of the subset sum pseudorandom number generators

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Other Objects (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

Iterative approximation of fixed points

Related objects

Reset password