Sciweavers

57 search results - page 2 / 12
» Complexity of Ring Morphism Problems
Sort
View
BSL
2000
153views more  BSL 2000»
13 years 5 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
IJAR
2006
92views more  IJAR 2006»
13 years 5 months ago
Possibilistic clustering approach to trackless ring Pattern Recognition in RICH counters
The pattern recognition problem in Ring Imaging CHerenkov (RICH) counters concerns the identification of an unknown number of rings whose centers and radii are assumed to be unkno...
A. M. Massone, Léonard Studer, Francesco Ma...
ANTS
2010
Springer
250views Algorithms» more  ANTS 2010»
13 years 9 months ago
A Subexponential Algorithm for Evaluating Large Degree Isogenies
An isogeny between elliptic curves is an algebraic morphism which is a group homomorphism. Many applications in cryptography require evaluating large degree isogenies between ellip...
David Jao, Vladimir Soukharev
ALGOSENSORS
2006
Springer
13 years 9 months ago
Self-deployment Algorithms for Mobile Sensors on a Ring
Abstract. We consider the self-deployment problem in a ring for a network of identical sensors: starting from some initial random placement in the ring, the sensors in the network ...
Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
13 years 11 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...