2479 search results - page 465 / 496 » Quantum complexity theory |
AWIC
2003
Springer
14 years 2 months ago
2003
Springer
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
PLDI
2010
ACM
14 years 2 months ago
2010
ACM
Low-level program analysis is a fundamental problem, taking the shape of “flow analysis” in functional languages and “points-to” analysis in imperative and object-oriente...
PODS
2010
ACM
14 years 2 months ago
2010
ACM
In the last few years, a lot of attention has been paid to the specification and subsequent manipulation of schema mappings, a problem which is of fundamental importance in metad...