1888 search results - page 134 / 378 » Proof theory and computational analysis |
106
click to vote
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
116
click to vote
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
107
click to vote
CATS
2006
15 years 2 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...
108
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
84
Voted
IPL
2006
15 years 18 days ago
2006
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...