5510 search results - page 1015 / 1102 » Mathematics |
253
click to vote
LCC
1994
15 years 8 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
136
click to vote
ICALP
1992
Springer
15 years 8 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
127
click to vote
SIGGRAPH
1993
ACM
15 years 8 months ago
1993
ACM
We present an efficient and robust algorithm for finding points of collision between time-dependent parametric and implicit surfaces. The algorithm detects simultaneous collisio...
123
click to vote
ICLP
1992
Springer
15 years 8 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
189
Voted
SPAA
1993
ACM
15 years 8 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...