Related papers: An Empirically Fast Las Vegas Algorithm for Algebr…
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
In this paper, we propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other…
This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…
We propose a dynamic slicing algorithm to compute the slices of aspect-oriented programs. We use a dependence based intermediate program representation called Aspect System Dependence Graph (AOSG) to represent aspect-oriented programs.…
Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform updates to conditional dependencies. The goal of adaptive…
This paper analyzes a special instance of nonsymmetric algebraic matrix Riccati equations arising from transport theory. Traditional approaches for finding the minimal nonnegative solution of the matrix Riccati equations are based on the…
In this paper we analyze several inexact fast augmented Lagrangian methods for solving linearly constrained convex optimization problems. Mainly, our methods rely on the combination of excessive-gap-like smoothing technique developed in…
In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
We present a probabilistic Las Vegas algorithm for computing the local zeta function of a hyperelliptic curve of genus $g$ defined over $\mathbb{F}_q$. It is based on the approaches by Schoof and Pila combined with a modeling of the…
We have established a coherent framework for applying variational methods to partial differential equations on hypergraphs, which includes the propositions of calculus and function spaces on hypergraphs. Several results related to the…
In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…
OSCAR is an innovative new computer algebra system which combines and extends the power of its four cornerstone systems - GAP (group theory), Singular (algebra and algebraic geometry), Polymake (polyhedral geometry), and Antic (number…
We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…
Directed acyclic graphs (DAGs) are commonly used to model causal relationships among random variables. In general, learning the DAG structure is both computationally and statistically challenging. Moreover, without additional information,…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
We present a fast algorithm for computing discrete cubical homology of graphs over finite fields with an appropriate characteristic. This algorithm improves on several computational steps compared to constructions in the existing…
Consider the set of solutions to a system of polynomial equations in many variables. An algebraic manifold is an open submanifold of such a set. We introduce a new method for computing integrals and sampling from distributions on algebraic…