Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework

This publication has 19 references indexed in Scilit:

• The Random-Facet simplex algorithm on combinatorial cubes
  Random Structures & Algorithms, 2002
• Small Progress Measures for Solving Parity Games
  Published by Springer Nature ,2000
• A Discrete Strategy Improvement Algorithm for Solving Parity Games
  Published by Springer Nature ,2000
• Combinatorial Linear Programming: Geometry Can Help
  Published by Springer Nature ,1998
• The complexity of mean payoff games on graphs
  Theoretical Computer Science, 1996
• A Subexponential Algorithm for Abstract Optimization Problems
  SIAM Journal on Computing, 1995
• A SUBEXPONENTIAL RANDOMIZED ALGORITHM FOR THE SIMPLE STOCHASTIC GAME PROBLEM
  Information and Computation, 1995
• The complexity of stochastic games
  Information and Computation, 1992
• Completely unimodal numberings of a simple polytope
  Discrete Applied Mathematics, 1988
• From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
  SIAM Journal on Discrete Mathematics, 1988