2233 search results - page 171 / 447 » On the Complexity of Theory Curbing |
173
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
176
click to vote
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. We apply the theory of asynchronous automata to the synthesis problem of closed distributed systems. We use safe asynchronous automata as implementation model, and charac...
180
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
160
click to vote
INDOCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
140
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...