Hochschulschrift
Verifying probabilistic systems : new algorithms and complexity results
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
0935-3232
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Aachen, Techn. Hochsch., Diss., 2014
- Bibliographic citation
-
Aachener Informatik-Berichte ; 16/2014
- Classification
-
Mathematik
- Keyword
-
Verifikation , Algorithmus
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
- (when)
-
2014
- Creator
- URN
-
urn:nbn:de:hbz:82-opus-52856
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 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.
Object type
- Hochschulschrift
Associated
- Fu, Hongfei
- Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
Time of origin
- 2014
Other Objects (12)
Computational Complexity of Verifying Parameterized Systems
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Decision algorithms for probabilistic simulations
Probabilistic analysis of simplex algorithms
Integer Optimization for Disjoint Trajectories: Complexity Results, Algorithms and Resilience to Uncertainty
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
Nondeterministic versus probabilistic linear search algorithms
Computational Complexity of Verifying Parameterized Systems
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Decision algorithms for probabilistic simulations
Probabilistic analysis of simplex algorithms
Integer Optimization for Disjoint Trajectories: Complexity Results, Algorithms and Resilience to Uncertainty
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
Nondeterministic versus probabilistic linear search algorithms
Computational Complexity of Verifying Parameterized Systems
Algorithms and complexity results for finite semigroups
Complexity results and practical algorithms for logics in knowledge representation
Complexity results and practical algorithms for logics in knowledge representation
Scheduling jobs with communication delays : complexity results and approximation algorithms
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Probabilistic learning of indexed families under monotonicity constraints : hierarchy results and complexity aspects
Decision algorithms for probabilistic simulations
Probabilistic analysis of simplex algorithms
Integer Optimization for Disjoint Trajectories: Complexity Results, Algorithms and Resilience to Uncertainty
Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions