155 search results - page 17 / 31 » Bounded Arithmetic and Descriptive Complexity |
59
Voted
AAECC
2007
Springer
15 years 5 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
DIMACS
2001
15 years 1 months ago
2001
The notion of relative closure (X, Y )0 of a semi-Pfaffian couple (X, Y ) was introduced by Gabrielov to give a description of the o-minimal structure generated by Pfaffian functio...
114
Voted
EM
2010
14 years 11 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
92
Voted
COMPGEOM
2003
ACM
15 years 4 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
102
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...