Skip to main content

A simple function that requires exponential size read-once branching programs

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Computational complexity; Projective planes; Read-once branching programs

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/S0020-0190(97)00041-0

Affiliations: DIMACS Center for Discrete Mathematics and Theoretical Computer Science), Rutgers University, Piscataway, NJ, USA

Publication date: April 14, 1997

els/00200190/1997/00000062/00000001/art00041
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more