1986•Unpublished venueRequires access

Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1

David A. Mix Barrington

Abstract

Article Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 Share on Author: D A Barrington Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986 Pages 1–5https://doi.org/10.1145/12130.12131Online:01 November 1986Publication History 113citation1,087DownloadsMetricsTotal Citations113Total Downloads1,087Last 12 Months19Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

About this research paper

What this paper is about

Why it matters

OpenAlex reports 685 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Citation, Bounded function, Branching (polymer chemistry), Computer science, Discrete mathematics, Combinatorics, Mathematics, World Wide Web