The following pages link to Carlo Comin (Q524361):
Displaying 6 items.
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm (Q1706164) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication (Q1799209) (← links)
- On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier (Q5079776) (← links)
- Incorporating decision nodes into conditional simple temporal networks (Q6486429) (← links)
