2941 search results - page 363 / 589 » The Myth of the Educational Computer |
173
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
142
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
175
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
ABSTRACT. Reasoning with diagrams: cognitive and computational perspectives. Diagrammatic, analogical or iconic representations are often contrasted with linguistic or logical repr...
148
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...