2941 search results - page 240 / 589 » The Myth of the Educational Computer |
126
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
111
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associate...
150
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes a method for risk analysis based on the approach used in CRAMM, but instead of using discrete measures for threats and vulnerabilities and lookup tables to de...
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
143
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...