1146 search results - page 85 / 230 » Finite cupping sets |
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
RAM
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper presents an algorithm for computing the distance between a point and a convex cone in n-dimensional space. The convex cone is specified by the set of all nonnegative com...
FOSSACS
2000
Springer
14 years 20 days ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
COMBINATORICS
2006
13 years 9 months ago
2006
We investigate the existence of edge-magic labellings of countably infinite graphs by abelian groups. We show for that for a large class of abelian groups, including the integers ...
JGO
2008
13 years 9 months ago
2008
This article complements the paper [7], where we showed that a compact feasible set of a standard semi-infinite optimization problem can be approximated arbitrarily well by a leve...