- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Using Semicontinuity for Standard Bases Computations ; volume:16 ; number:4 ; day:17 ; month:10 ; year:2022 ; pages:1-11 ; date:12.2022
Mathematics in computer science ; 16, Heft 4 (17.10.2022), 1-11, 12.2022
- Urheber
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s11786-022-00539-2
- URN
-
urn:nbn:de:101:1-2023120809125052652289
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 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
- Greuel, Gert-Martin
- Pfister, Gerhard
- Schönemann, Hans
- SpringerLink (Online service)
Ähnliche Objekte (12)
Monomial Representations for Gröbner Bases Computations
Securely outsourcing computations using homomorphic encryption
Securely Outsourcing Computations using Homomorphic Encryption
Adhesive joint computations using cohesive zones
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Total positivity and accurate computations with Gram matrices of Bernstein bases
Improved computations for relationship inference using low-coverage sequencing data
Persistent Computations
Admissible representations for continuous computations
Formular for Maya calendrical computations
Admissible representations for continuous computations
Monomial Representations for Gröbner Bases Computations
Securely outsourcing computations using homomorphic encryption
Securely Outsourcing Computations using Homomorphic Encryption
Adhesive joint computations using cohesive zones
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Total positivity and accurate computations with Gram matrices of Bernstein bases
Improved computations for relationship inference using low-coverage sequencing data
Persistent Computations
Admissible representations for continuous computations
Formular for Maya calendrical computations
Admissible representations for continuous computations
Monomial Representations for Gröbner Bases Computations
Securely outsourcing computations using homomorphic encryption
Securely Outsourcing Computations using Homomorphic Encryption
Adhesive joint computations using cohesive zones
Complexity of Gröbner bases computations and applications to cryptography - lecture 1
Complexity of Gröbner bases computations and applications to cryptography - lecture 2
Total positivity and accurate computations with Gram matrices of Bernstein bases
Improved computations for relationship inference using low-coverage sequencing data
Persistent Computations
Admissible representations for continuous computations
Formular for Maya calendrical computations