Correction to “Computational complexity of algebraic functions”
نویسندگان
چکیده
منابع مشابه
An Algebraic Approach to Computational Complexity
The theory of computational complexity is concerned with identifying methods for computing solutions to problems in a minimal number of steps. Despite the diversity of application areas from which such problems can be drawn this theory has been successful in identifying a small number of fundamental questions on which a sizable fraction of the field hangs. A prime example is the P = ?ÎTP questi...
متن کاملAlgebraic Aspects of Complexity Functions
We introduce the algebraic structure of GapP (resp. ]P) functions by formalizing them as a power series ring(resp. semiring), and a multiplicative group as well for all invertible functions. We investigate the algebraic properties of GapP related to subrings, ideals, and their connections with the complexity theory. We prove that for every GapP function g, P g = P g ?1 , and for all positive in...
متن کاملComputational Complexity of Functions
Below is a translation from my Russian paper. I added references, unavailable to me in Moscow. Similar results have been also given in [Schnorr Stumpf 75] (see also [Lynch 75]). Earlier relevant work (classical theorems like Compression, Speed-up, etc.) was done in [Tseitin 56, Rabin 59, Hartmanis Stearns 65, Blum 67, Trakhtenbrot 67, Meyer Fischer 72]. I translated only the part with the state...
متن کاملComputational Complexity of Solving Real Algebraic Formulae
where e e IR", b e IR" and A is an m x n matrix. In the last four years there has been a vast amount of work on "interior point" algorithms, motivated by Karmarkar's algorithm [16]. Unlike the traditional simplex method which moves from vertex to vertex around the feasible region {x;>4x > b}, interior point methods proceed through the interior {x;Ax > b] of the feasible region. Karmarkar's algo...
متن کاملAlgebraic Methods in Computational Complexity Dagstuhl Seminar
From 11.10. to 16.10.2009, the Dagstuhl Seminar 09421 Algebraic Methods in Computational Complexity was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90015-3