We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
We study two different lot-sizing problems with time windows that have been proposed recently. For the case of production time windows, in which each client specific order must be ...