A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important questi...
We report on some initial results of a brute-force search for determining the maximum correlation between degree-d polynomials modulo p and the n-bit mod q function. For various s...
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
The last two decades have seen enormous progress in the development of sublinear-time algorithms — i.e., algorithms that examine/reveal properties of “data” in less time tha...
We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?
man and Kenneth O. Stanley (2010). Revising the Evolutionary Computation Abstraction: Minimal Criteria Novelty Search. In: Proceedings of the Genetic and Evolutionary Computation C...
Abstract: Much has been written about word of mouth and customer behavior. Telephone call detail records provide a novel way to understand the strength of the relationship between ...
In the current paper, we outline several approaches to determine the value of information system (IS) flexibility, defined as the extent to which an IS can be modified and upgrade...
: We study a new supply chain network design problem with environmental concerns. We are interested in the environmental investments decisions in the design phase and propose a mul...
We present a technique that efficiently describes nonstationarity by parametrizing spectral peaks in terms of the frequency reassignment operator variation and null-to-null peak b...