- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Theoretical Computer Science, 53.1987, 2-3, S. 201-224
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2023
- Urheber
- DOI
-
10.1016/0304-3975(87)90064-8
- URN
-
urn:nbn:de:hebis:30:3-758869
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:42 MEZ
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
- Schnorr, Claus Peter
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2023
Ähnliche Objekte (12)
Lattice basis reduction algorithms and their applications
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Polynomial Algorithms for Estimating Network Reliability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Solving polynomial equations : foundations, algorithms, and applications
Polynomial time algorithms for network information flow
Practical lattice basis sampling reduction
Fast LLL-type lattice reduction
The dot-depth and the polynomial hierarchy correspond on the delta levels
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lattice basis reduction algorithms and their applications
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Polynomial Algorithms for Estimating Network Reliability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Solving polynomial equations : foundations, algorithms, and applications
Polynomial time algorithms for network information flow
Practical lattice basis sampling reduction
Fast LLL-type lattice reduction
The dot-depth and the polynomial hierarchy correspond on the delta levels
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lattice basis reduction algorithms and their applications
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Lattice basis reduction : improved practical algorithms and solving subset sum problems
Polynomial Algorithms for Estimating Network Reliability
Parameterized complexity in the polynomial hierarchy : extending parameterized complexity theory to higher levels of the hierarchy
Solving polynomial equations : foundations, algorithms, and applications
Polynomial time algorithms for network information flow
Practical lattice basis sampling reduction
Fast LLL-type lattice reduction
The dot-depth and the polynomial hierarchy correspond on the delta levels
Placing problems from phylogenetics and (quantified) propositional logic in the polynomial hierarchy