276 search results - page 15 / 56 » The Complexity of Computing Maximal Word Functions |
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
We consider the filter generator over GF(2m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2mk − 1 over G...
MA
2010
Springer
13 years 5 months ago
2010
Springer
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...
TBILLC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, I give an overview of an ongoing project which aims at building a full-scale computational grammar for Georgian in the Lexical Functional Grammar framework and try t...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
SIAMJO
2008
13 years 7 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...