We consider the algebra of invariants of binary forms of degree 10 with complex coefficients, construct a system of parameters with degrees 2, 4, 6, 6, 8, 9, 10, 14 and find the ...
Let Fq be a finite field and consider an extension Fqn where an optimal normal element exists. Using the trace of an optimal normal element in Fqn , we provide low complexity norma...
Maria Christopoulou, Theodoulos Garefalakis, Danie...
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...