484 search results - page 17 / 97 » Computing Hilbert Class Polynomials |
UC
2005
Springer
14 years 29 days ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
NC
2011
12 years 10 months ago
2011
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be ap...
CSR
2010
Springer
14 years 9 days ago
2010
Springer
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
SSD
2007
Springer
2007
Springer
Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy
14 years 1 months ago
In this paper we propose a fundamental approach to perform the class of Nearest Neighbor (NN) queries, the core class of queries used in many of the location-based services, withou...