436 search results - page 14 / 88 » A Note on Negligible Functions |
ASAP
2010
IEEE
13 years 10 months ago
2010
IEEE
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
AI
2006
Springer
13 years 8 months ago
2006
Springer
The Spohnian paradigm of ranking functions is in many respects like an order-of-magnitude reverse of subjective probability theory. Unlike probabilities, however, ranking function...
TIT
2011
13 years 3 months ago
2011
Abstract. In this note we report the following computational results on partial spread functions in 8 variables: (i) the numbers of equivalence classes of partial spread functions ...
EJC
2008
13 years 8 months ago
2008
1 Rational functions and minimal factorizations of permutations Let f : C C be a rational function of degree n in one complex variable. A critical point of f is a point z C such...
CIE
2010
Springer
14 years 1 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...