Nonapproximability results for partially observable Markov decision processes

Computer Science

• Complexity Class 50%
• Constant Factor 50%
• Efficient Computation 50%
• Markov Decision Process 100%
• Performance Guarantee 50%
• polynomial-time algorithm 50%

Engineering

• Partially Observable Markov Decision Process 100%
• Policy Control 100%
• Polynomial Time 50%

Mathematics

• Constant Factor 50%
• Partially Observable Markov Decision Process 100%
• Polynomial Time 50%