A Note on Data Types Supporting Efficient Implementations of Polynomial Arithmetics
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Report / Institut für Informatik ; 1998,10
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Leipzig
- (wer)
-
Universität Leipzig
- (wann)
-
2019
- Ereignis
-
Veröffentlichung
- (wo)
-
Leipzig
- (wer)
-
Universitätsbibliothek Leipzig
- (wann)
-
2019
- Urheber
- URN
-
urn:nbn:de:bsz:15-qucosa2-345247
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:39 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
- Apel, Joachim
- Klaus, Uwe
- Universität Leipzig
- Universitätsbibliothek Leipzig
Entstanden
- 2019
Ähnliche Objekte (12)
Efficient parallel implementations of eigenproblems reduction
Linear methods for polynomial factorization over finite fields : theory and implementations
Secure and efficient hardware implementations for modern cryptography
Efficient implementations of rainbow and UOV using AVX2
Efficient, perfect polynomial random number generators
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Efficient HPC implementations for large-scale molecular simulation in process engineering
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations
A modified prefix operator well suited for area-efficient brick-based adder implementations
Efficient parallel implementations of eigenproblems reduction
Linear methods for polynomial factorization over finite fields : theory and implementations
Secure and efficient hardware implementations for modern cryptography
Efficient implementations of rainbow and UOV using AVX2
Efficient, perfect polynomial random number generators
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Efficient HPC implementations for large-scale molecular simulation in process engineering
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations
A modified prefix operator well suited for area-efficient brick-based adder implementations
Efficient parallel implementations of eigenproblems reduction
Linear methods for polynomial factorization over finite fields : theory and implementations
Secure and efficient hardware implementations for modern cryptography
Efficient implementations of rainbow and UOV using AVX2
Efficient, perfect polynomial random number generators
On Hard Subgraph Problems: Parameterized Algorithms and Efficient Implementations
Using Design Patterns for Reusable, Efficient Implementations of Graph Algorithms
Types with potential: polynomial resource bounds via automatic amortized analysis
Types with potential : polynomial resource bounds via automatic amortized analysis
Efficient HPC implementations for large-scale molecular simulation in process engineering
Robotic exploration and landmark determination : hardware efficient algorithms and FPGA implementations