- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Theoretical Computer Science, 53.1987, 2-3, S. 201-224
- Event
-
Veröffentlichung
- (where)
-
Frankfurt am Main
- (who)
-
Universitätsbibliothek Johann Christian Senckenberg
- (when)
-
2023
- Creator
- DOI
-
10.1016/0304-3975(87)90064-8
- URN
-
urn:nbn:de:hebis:30:3-758869
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:42 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Schnorr, Claus Peter
- Universitätsbibliothek Johann Christian Senckenberg
Time of origin
- 2023
Other Objects (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