468 search results - page 69 / 94 » One-Way Functions in Complexity Theory |
107
Voted
DAM
2011
14 years 6 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
121
click to vote
ACMACE
2004
ACM
15 years 4 months ago
2004
ACM
This paper discusses the design of audio games, a quite new computer game category that originates from games for players with visual impairments, as well as mainstream music game...
119
click to vote
GECCO
2007
Springer
15 years 2 months ago
2007
Springer
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
TOPLAS
2008
14 years 11 months ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
168
click to vote
ICDE
2008
IEEE
16 years 12 days ago
2008
IEEE
We consider a privacy threat to a social network in which the goal of an attacker is to obtain knowledge of a significant fraction of the links in the network. We formalize the ty...