5100 search results - page 749 / 1020 » The Linear Complexity of a Graph |
177
click to vote
SIGSOFT
2006
ACM
16 years 15 days ago
2006
ACM
Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to contr...
158
click to vote
COCO
2005
Springer
16 years 3 days ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
182
click to vote
INDOCRYPT
2005
Springer
16 years 2 days ago
2005
Springer
1 Dragon is a word oriented stream cipher submitted to the ECRYPT project, it operates on key sizes of 128 and 256 bits. The original idea of the design is to use a nonlinear feedb...
154
click to vote
LPNMR
2005
Springer
16 years 1 days ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
180
click to vote
APLAS
2004
ACM
16 years 24 min ago
2004
ACM
Abstract. More than being just a tool for expressing algorithms, a welldesigned programming language allows the user to express her ideas efficiently. The design choices however e...