Lower bounds for solving linear diophantine equations on random access machines
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Journal of the Association for Computing Machinery Jg. 1985 (1984), S. 929-937
- Klassifikation
-
Allgemeines, Wissenschaft
- Ereignis
-
Veröffentlichung
- (wo)
-
Paderborn
- (wer)
-
Universitätsbibliothek
- (wann)
-
1984
- Urheber
- URN
-
urn:nbn:de:hbz:466:2-5951
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:56 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
- Meyer auf der Heide, Friedhelm
- Universitätsbibliothek
Entstanden
- 1984
Ähnliche Objekte (12)
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Exponential lower bounds for solving infinitary payoff games and linear programs
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower time bounds for solving linear diophantine equations on several parallel computational models
Solving infinite games with bounds
Solving infinite games with bounds
Feasible real random access machines
Feasible Real Random Access Machines
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Bisimulation on Speed: Lower Time Bounds
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Exponential lower bounds for solving infinitary payoff games and linear programs
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower time bounds for solving linear diophantine equations on several parallel computational models
Solving infinite games with bounds
Solving infinite games with bounds
Feasible real random access machines
Feasible Real Random Access Machines
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues
Bisimulation on Speed: Lower Time Bounds
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs
Exponential lower bounds for solving infinitary payoff games and linear programs
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Lower time bounds for solving linear diophantine equations on several parallel computational models
Solving infinite games with bounds
Solving infinite games with bounds
Feasible real random access machines
Feasible Real Random Access Machines
Lower Bounds for Heuristic Algorithms
Lower bounds for RCPSP-max
Guaranteed lower bounds for eigenvalues