Functions computable in polynomial space

Authors:
Matthias Galota;Heribert Vollmer
Affiliations:
Theoretische Informatik, Universität Hannover, Appelstraße 4, 30167 Hannover, Germany;Theoretische Informatik, Universität Hannover, Appelstraße 4, 30167 Hannover, Germany
Venue:
Information and Computation
Year:
2005

Citing 10
Cited 0

Succinct representations of graphs

Information and Control
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A new pebble game that characterizes parallel complexity classes

SIAM Journal on Computing
Polynomial space counting problems

SIAM Journal on Computing
Computing algebraic formulas using a constant number of registers

SIAM Journal on Computing
A uniform approach to define complexity classes

Theoretical Computer Science
Succinct representation, leaf languages, and projection reductions

Information and Computation
Nondeterministic NC1 computation

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Uniform characterizations of complexity classes

ACM SIGACT News
Introduction to Circuit Complexity: A Uniform Approach

Introduction to Circuit Complexity: A Uniform Approach

Quantified Score

Hi-index	0.02

Visualization

Abstract

Consider nondeterministic polynomial-time Turing machine that on input x outputs a 3 × 3 matrix with entries from {-1,0,1} on each of its paths. Define the function f where f(x) is the upper left entry in the product of all these matrices (in an order of the paths to be made precise below). We show that the class of functions f computable as just described is exactly the class FPSPACE of integer-valued functions computable by polynomial-space Turing machines. Along the way we obtain characterizations of FPSPACE in terms of arithmetic circuits and straight-line programs.