Recommendations
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 3561065 (Why is no real title available?)
- scientific article; zbMATH DE number 3566230 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1983335 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Alternation
- Computational Complexity of Probabilistic Turing Machines
- Dynamic programming and stochastic control
- On the complexity of some two-person perfect-information games
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of computing the permanent
- The polynomial-time hierarchy
Cited in
(56)- Complexity and approximability of quantified and stochastic constraint satisfaction problems
- Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete.
- Randomization for robot tasks: using dynamic programming in the space of knowledge states
- Challenges in Constraint-Based Analysis of Hybrid Systems
- Towards logical foundations for probabilistic computation
- Sound and efficient closed-world reasoning for planning
- Interactive and probabilistic proof-checking
- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems
- Scheduling Stochastic Jobs with a Two-Point Distribution on Two Parallel Machines
- Exact stochastic constraint optimisation with applications in network analysis
- Probabilistic game automata
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata
- How Good Is a Strategy in a Game with Nature?
- Generalizations of Opt P to the polynomial hierarchy
- Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
- APPSSAT: Approximate probabilistic planning using stochastic satisfiability
- Dot operators
- Moving in a network under random failures: a complexity analysis
- Minimum disclosure proofs of knowledge
- Shortest paths without a map
- A resolution proof system for dependency stochastic Boolean satisfiability
- The stochastic arrival problem
- Quantum alternation
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
- Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
- On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
- Generalized Craig interpolation for stochastic Boolean satisfiability problems
- On the complexity of computational problems associated with simple stochastic games
- scientific article; zbMATH DE number 3128725 (Why is no real title available?)
- TETRIS IS HARD, EVEN TO APPROXIMATE
- On sabotage games
- Quantum multi-prover interactive proof systems with limited prior entanglement.
- On counting propositional logic and Wagner's hierarchy
- Confidence-based reasoning in stochastic constraint programming
- Generalized quantum Arthur-Merlin games
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements
- On the complexity of partially observed Markov decision processes
- Abstraction-based decision making for statistical properties (invited talk)
- scientific article; zbMATH DE number 3916056 (Why is no real title available?)
- Approximate counting in SMT and value estimation for probabilistic programs
- Curry and Howard meet Borel
- An application of quantum finite automata to interactive proof systems
- A short certificate of the number of universal optimal strategies for stopping simple stochastic games
- The polynomial hierarchy and a simple model for competitive analysis
- Classifying the computational complexity of problems
- Interactive foundations of computing
- De Groot duality and models of choice: angels, demons and nature
- Contingent planning under uncertainty via stochastic satisfiability
- The complexity of stochastic games
- The cost of adaptivity in security games on graphs
- Decision algorithms for multiplayer noncooperative games of incomplete information
- From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future
- Computation of equilibria in noncooperative games
- Computational complexity of stochastic programming problems
This page was built for publication: Games against nature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069296)
