Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
In this paper we discuss some well-known morphological descriptions used in various projects and applications (most notably MULTEXT-East and Unitex) and illustrate the encountered...
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
: Each linear program (LP) has an optimal basis. The space of linear programs can be partitioned according to these bases, so called the basis partition. Discovering the structures...