2286 search results - page 110 / 458 » Algorithms for Categorical Equivalence |
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
108
click to vote
CCCG
2009
14 years 11 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
act Interpretation SILVIA CRAFA FRANCESCO RANZATO University of Padova, Italy We show how bisimulation equivalence and simulation preorder on probabilistic LTSs (PLTSs), namely the...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
WDAG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...