Sciweavers

4047 search results - page 342 / 810
» The Discrete Basis Problem
Sort
View
133
Voted
UC
2005
Springer
15 years 10 months ago
On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
Predrag T. Tosic, Gul A. Agha
146
Voted
ASIACRYPT
2003
Springer
15 years 10 months ago
On Class Group Computations Using the Number Field Sieve
The best practical algorithm for class group computations in imaginary quadratic number fields (such as group structure, class number, discrete logarithm computations) is a varian...
Mark L. Bauer, Safuat Hamdy
KR
2010
Springer
15 years 9 months ago
Diagnosis as Planning Revisited
In discrete dynamical systems change results from actions. As such, given a set of observations, diagnoses often take the form of posited events that result in the observed behavi...
Shirin Sohrabi, Jorge A. Baier, Sheila A. McIlrait...
121
Voted
WIA
2001
Springer
15 years 9 months ago
Past Pushdown Timed Automata
d Abstract) Zhe Dang   , Tevfik Bultan ¡ , Oscar H. Ibarra ¡ , and Richard A. Kemmerer ¡ ¢ School of Electrical Engineering and Computer Science Washington State University P...
Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard ...
211
Voted
NDSS
2000
IEEE
15 years 9 months ago
Chameleon Signatures
Abstract. Chameleon signatures simultaneously provide the properties of nonrepudiation and non-transferability for the signed message. However, the initial constructions of chamele...
Hugo Krawczyk, Tal Rabin