Sciweavers

2446 search results - page 78 / 490
» Choiceless Polynomial Time
Sort
View
ASIACRYPT
2004
Springer
14 years 1 months ago
The XL-Algorithm and a Conjecture from Commutative Algebra
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
Claus Diem
CHES
2000
Springer
86views Cryptology» more  CHES 2000»
14 years 1 days ago
MiniPASS: Authentication and Digital Signatures in a Constrained Environment
Abstract. We describe an implementation of the PASS polynomial authentication and signature scheme [5, 6] that is suitable for use in highly constrained environments such as SmartC...
Jeffrey Hoffstein, Joseph H. Silverman
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
14 years 29 days ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 7 months ago
Explicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
Laurent Busé, Bernard Mourrain
PPAM
2005
Springer
14 years 1 months ago
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...
Krzysztof Giaro, Marek Kubale