Sciweavers

922 search results - page 37 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
DM
1999
79views more  DM 1999»
13 years 7 months ago
A bijective proof of Riordan's theorem on powers of Fibonacci numbers
Let Fk(x) = n=0 Fk n xn . Using the interpretation of Fibonacci numbers in the terms of Morse codes, we give a bijective proof of Riordan's formula (1 - Lkx + (-1)k x2 )Fk(x...
Andrej Dujella
CCS
2004
ACM
14 years 1 months ago
Cryptanalysis of a provably secure CRT-RSA algorithm
We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we...
David Wagner
EMO
2003
Springer
86views Optimization» more  EMO 2003»
14 years 29 days ago
No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
David Corne, Joshua D. Knowles
TARK
2009
Springer
14 years 2 months ago
Program equilibria and discounted computation time
Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Lance Fortnow
CADE
2007
Springer
14 years 1 months ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak