Computer Science
Markov Decision Process
100%
Automaton
89%
Model Checking
87%
Temporal Logic
71%
Markov Chain
56%
Polynomial Time
44%
Fixed Points
41%
State Machine
38%
Linear Temporal Logic
33%
Newton's Method
30%
Termination Problem
29%
Context-Free Grammars
28%
Polynomial Time Algorithm
26%
Computational Complexity
25%
Polynomial Equation
22%
Optimal Strategy
20%
Transitive Closure
20%
Decision Problem
19%
Procedural Program
19%
Multiobjective
18%
And-States
16%
Theoretic Model
15%
Simulation Relation
14%
State Space
13%
Model Checking Problem
12%
Concurrent System
12%
Objective Model
12%
Logarithmic Space
12%
Reachability Probability
12%
Pushdown Automaton
11%
Stochastic Model
11%
Birth-Death Process
10%
Transition Graph
9%
Structural Property
9%
Equation System
8%
polynomial-time algorithm
8%
Model of Computation
8%
Approximation (Algorithm)
8%
Concurrent Program
8%
Approximation Problem
7%
Efficient Algorithm
7%
Regular Language
7%
Finite Automata
7%
Termination Probability
6%
Direct Simulation
6%
Formal Framework
6%
Query Language
6%
Software Designer
6%
Sufficient Condition
6%
Modified Version
6%
Mathematics
Polynomial Time
55%
Probability Theory
50%
Stochastic Game
42%
Markov Decision Process
42%
Upper Bound
41%
Temporal Logic
39%
Fixed Points
32%
Min-Max
26%
Nash Equilibrium
25%
Polynomial
23%
Markov Chain
21%
Newton's Method
18%
Extinction Probability
18%
Polynomial Equation
16%
Branching Process
16%
Transitive Closure
15%
Bellman Equation
15%
Graph Model
12%
Parametric
12%
Stochastic Process
12%
Approximates
11%
Death Process
10%
Stochastics
9%
Greatest Fixed Point
9%
State Markov Chain
9%
Additive Error
8%
Optimality
8%
Equation System
8%
Ordered Structure
7%
Model of Computation
7%
Turing Machine
7%
Open Problem
7%
Birth and Death Process
6%
Memoryless
6%
Tree-Like
6%
Time Model
6%
Integer
6%
Linear Forms In Logarithms
6%
Structural Property
6%
Linear Programming
6%
Necessary and Sufficient Condition
6%
Line Graph
6%
Total Ordering
6%
Optimal Policy
5%
