We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...
Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Abstract—Many practical applications require the reconstruction of images from irregularly sampled data. The spline formalism offers an attractive framework for solving this prob...
Oleksii Vyacheslav Morozov, Michael Unser, Patrick...