- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.1038/s41467-024-52488-y
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2024
- Urheber
-
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
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:23 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
- 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
Entstanden
- 2024
Ähnliche Objekte (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