Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
Boolean Complexity Classes vs. Their Arithmetic Analogs
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
A. Gal
A. Wigderson
Publication:
Random Structures and Algorithms, vol. 9, pp. 1-13, 1996.
ECCC Report TR05-049, 1995.
Year:
1995
Abstract:
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/gw96.pdf
Hide
Files
File:
Journal version (pdf)
Journal version (ps)
‹ BPP has Subexponential Time Simulations unless EXPTIME has Publishable Proofs
up
Combinatorial Characterization of Read-Once Formulae ›