Sciweavers

2412 search results - page 7 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
IJAC
2007
73views more  IJAC 2007»
13 years 9 months ago
Computationally and Algebraically Complex Finite Algebra Membership Problems
In this paper we produce a finite algebra which generates a variety with a PSPACE-complete membership problem. We produce another finite algebra with a γ function that grows exp...
Marcin Kozik
JAL
1998
74views more  JAL 1998»
13 years 9 months ago
A Survey of Fast Exponentiation Methods
Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this expon...
Daniel M. Gordon
ASIACRYPT
2008
Springer
13 years 11 months ago
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 10 months ago
Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...
Lijun Zhang, Holger Hermanns, Friedrich Eisenbrand...
ICCAD
2006
IEEE
157views Hardware» more  ICCAD 2006»
14 years 6 months ago
From single core to multi-core: preparing for a new exponential
In the past, processor design trends were dominated by increasingly complex feature sets, higher clock speeds, growing thermal envelopes and increasing power dissipation. Recently...
Jeff Parkhurst, John A. Darringer, Bill Grundmann