
Listing Small Minimal Separators of a Graph
Let G be a graph and a,b vertices of G. A minimal a,bseparator of G is ...
read it

On the Exponential Rate of Convergence of Fictitious Play in Potential Games
The paper studies fictitious play (FP) learning dynamics in continuous t...
read it

An iterative algorithm for approximating roots of integers
We explore an algorithm for approximating roots of integers, discuss its...
read it

Polynomial Delay Enumeration for Minimal Steiner Problems
Let G = (V, E) be a undirected graph and let W ⊆ V be a set of terminals...
read it

Approximating the covariance ellipsoid
We explore ways in which the covariance ellipsoid B={v ∈R^d : E <X,v>^2...
read it

Decision times of infinite computations
The decision time of an infinite time algorithm is the supremum of its h...
read it

Approximating the Permanent of a Random Matrix with Vanishing Mean
Building upon a recent approach pioneered by Barvinok [4, 5, 7, 8] we pr...
read it
Approximating the Minimal Lookahead Needed to Win Infinite Games
We present an exponentialtime algorithm approximating the minimal lookahead necessary to win an ωregular delay game.
READ FULL TEXT
Comments
There are no comments yet.