A characterization of Hash P by arithmetic straight line programs

Authors:
L. Babai;L. Fortnow
Affiliations:
Chicago Univ., IL, USA;Chicago Univ., IL, USA
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 2

Simple characterizations of P(#P) and complete problems

Journal of Computer and System Sciences
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hash P functions are characterized by certain straight-line programs of multivariate polynomials. The power of this characterization is illustrated by a number of consequences. These include a somewhat simplified proof of S. Toda's (1989) theorem that PH contained in P/sup Hash P/, as well as an infinite class of potentially inequivalent checkable functions.