5606 search results - page 970 / 1122 » Randomization Techniques for Graphs. |
179
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
157
click to vote
VVS
1998
IEEE
15 years 10 months ago
1998
IEEE
A visibility ordering of a set of objects, from a given viewpoint, is a total order on the objects such that if object a obstructs object b, then b precedes a in the ordering. Suc...
228
click to vote
WOSP
1998
ACM
15 years 10 months ago
1998
ACM
The POEMS project is creating an environment for end-to-end performance modeling of complex parallel and distributed systems, spanning the domains of application software, runti...
176
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Interactive modeling of 3-D solids is an important and difficult problem in computer graphics. The Constructive Solid Geometry (CSG) modeling scheme is highly attractive for inte...
299
click to vote
LCC
1994
15 years 10 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...