Sciweavers

625 search results - page 57 / 125
» Generalized Ring Signatures
Sort
View
COCOON
2008
Springer
13 years 9 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
FOCM
2006
59views more  FOCM 2006»
13 years 7 months ago
Newton-Hensel Interpolation Lifting
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...
Martin Avendano, Teresa Krick, Ariel Pacetti
IJAC
2006
87views more  IJAC 2006»
13 years 7 months ago
Evaluation Properties of Symmetric Polynomials
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
Pierrick Gaudry, Éric Schost, Nicolas M. Th...
EJC
2007
13 years 7 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
JPDC
2007
95views more  JPDC 2007»
13 years 7 months ago
Self-stabilizing algorithm for checkpointing in a distributed system
If the variables used for a checkpointing algorithm have data faults, the existing checkpointing and recovery algorithms may fail. In this paper, self-stabilizing data fault detec...
Partha Sarathi Mandal, Krishnendu Mukhopadhyaya