The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
Counting the number of distinct factors in the words of a language gives a measure of complexity for that language similar to the factor-complexity of infinite words. Similarly as ...
We address the problem of reconstructing a planar shape from a finite number of noisy measurements of its support function or its diameter function. New linear and non-linear algor...
Amyn Poonawala, Peyman Milanfar, Richard J. Gardne...
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...