scientific article
From MaRDI portal
Publication:3311653
zbMath0529.68014MaRDI QIDQ3311653
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power, On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes, Array processing machines: an abstract model, Sequential and parallel complexity of approximate evaluation of polynomial zeros, On the parallel complexity of linear groups, Complexity, combinatorial group theory and the language of palutators, Chordal graph recognition is in NC, Parallel complexity of algebraic operations, Application of contractor directions for solving systems of nonlinear equations, Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices, On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs, Nondeterministics circuits, space complexity and quasigroups
