1379 search results - page 59 / 276 » The Complexity of the Annihilating Polynomial |
96
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
108
Voted
ICANN
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...
82
Voted
SIROCCO
2003
15 years 1 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
106
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
94
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...