Skip to main navigation
Skip to search
Skip to main content
University of Edinburgh Research Explorer Home
Help & FAQ
Home
Research output
Profiles
Research units
Projects
Datasets
Prizes
Activities
Press/Media
Equipment
Search by expertise, name or affiliation
Efficient algorithms for verification of recursive probabilistic system
Etessami, Kousha
(Principal Investigator)
School of Informatics
Laboratory for Foundations of Computer Science
Overview
Fingerprint
Research output
(1)
Project Details
Status
Finished
Effective start/end date
30/03/13
→
29/03/15
Funding
UK-based charities:
£11,950.00
View all
View less
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
Polynomial Equation
Computer Science
100%
Fixed Point
Computer Science
100%
Greatest Fixed Point
Mathematics
100%
Probability Theory
Mathematics
42%
Reachability Probability
Computer Science
35%
Algorithms
Computer Science
28%
Supremum
Mathematics
14%
Polynomial Time
Mathematics
14%
Research output
Research output per year
2018
2018
2018
1
Article
Research output per year
Research output per year
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
Etessami, K.
,
Stewart, A.
&
Yannakakis, M.
,
Aug 2018
,
In:
Information and Computation.
261
,
2
,
p. 355-382
28 p.
Research output
:
Contribution to journal
›
Article
›
peer-review
Open Access
File
Fixed Point
100%
Polynomial Equation
100%
Greatest Fixed Point
100%
Probability Theory
42%
Reachability Probability
35%