Computing high-degree polynomial gradients in memory

to related objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: 10.1038/s41467-024-52488-y

Event: Veröffentlichung

(where): Aachen

(who): Universitätsbibliothek der RWTH Aachen

(when): 2024

Creator: Bhattacharya, Tinish
Hutchinson, George H.
Pedretti, Giacomo
Sheng, Xia
Ignowski, Jim
Van Vaerenbergh, Thomas
Beausoleil, Ray
Strachan, John Paul
Strukov, Dmitri B.

DOI: 10.18154/RWTH-2024-09362

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

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

Last update: 15.08.2025, 7:23 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

Bhattacharya, Tinish
Hutchinson, George H.
Pedretti, Giacomo
Sheng, Xia
Ignowski, Jim
Van Vaerenbergh, Thomas
Beausoleil, Ray
Strachan, John Paul
Strukov, Dmitri B.
Universitätsbibliothek der RWTH Aachen

Time of origin

2024

Other Objects (12)

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

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.

Computing high-degree polynomial gradients in memory

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

Computing high-degree polynomial gradients in memory

Polynomial Mappings with Small Degree

Computing polynomial program invariants

Computing images of polynomial maps

Computing images of polynomial maps

Solving Degree Bounds for Iterated Polynomial Systems

Defect and degree of the Alexander polynomial

Computing 2-walks in polynomial time

Computing optimal coalition structures in polynomial time

COMPUTING THE CHARACTERISTIC POLYNOMIAL OF A MULTIGRAPH

Computing the Binomial Part of Polynomial Ideals

Computing knots by quadratic and cubic polynomial curves

Related objects

Reset password