2060 search results - page 112 / 412 » Some Applications of Coding Theory in Computational Complexi... |
ISW
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Program obfuscation is a semantic-preserving transformation aimed at bringing a program into such a form, which impedes the understanding of its algorithm and data struct...
CORR
1999
Springer
14 years 9 months ago
1999
Springer
ABSTRACT. We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combi...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
SIGCSE
2009
ACM
15 years 10 months ago
2009
ACM
Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software sys...
108
click to vote
FPL
2008
Springer
14 years 11 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...