Straight-Line Program Length as a Parameter for Complexity Analysis
نویسنده
چکیده
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any algebra. The parameter is simply the straight-line program length in the associated free algebra. This parameter generalizes the usual measures in basic arithmetic and string algebras, as well as some apparently different measures used for data structure algorithms. Another use is illustrated with an introduction to complexity-bounded group theory.
منابع مشابه
Interpolation of polynomials given by straight-line programs
We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in τ, log(d), L, n, where τ is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.
متن کاملOn the Ultimate Complexity of Factorials
It has long been observed that certain factorization algorithms provide a way to write product of a lot of integers succinctly. In this paper, we study the problem of representing the product of all integers from 1 to n (n!) by straight-line programs. Formally, we say that a sequence of integers an is ultimately f(n)-computable, if there exists a nonzero integer sequence mn such that for any n,...
متن کاملSynthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Abstract. Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shortest linear straight-line program for a given set of linear forms is known to be MaxSNP-complete, i.e., there is no ǫ-approximation for the problem unless P = NP . This paper presents a non-approximative appr...
متن کاملPolar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case
In this paper we apply for the rst time a new method for multivariate equation solving which was developed in 18], 19], 20] for complex root determination to the real case. Our main result concerns the problem of nding at least one representative point for each connected component of a real compact and smooth hypersurface. The basic algorithm of 18], 19], 20] yields a new method for symbolicall...
متن کاملText matching of strings in terms of straight line program by compressed aleshin type automata
In this paper we are checking the equivalence of any given text of strings is represented by a straight line program (SLP) with model text. For a given SLP-compressed Aleshin type automata D of size n and height h representing m patterns of total length N, we present an O (n log N)-size representation of Aho-Corasick automaton which recognizes all occurrences of the patterns in D in amortized O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 21 شماره
صفحات -
تاریخ انتشار 1980