Circuits and Context-free Languages

Circuits and Context-free Languages (1999)

Cached

Download Links

[www.iro.umontreal.ca]

Other Repositories/Bibliography

DBLP

by Pierre Mckenzie , Klaus Reinhardt , V Vinay

Venue:	In Proceedings of 5th Annual Internat. Conf. on Computing and Combinatorics (COCOON
Citations:	2 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Circuits and Context-free Languages	user correction - Legacy Corrections
AUTHOR NAME	Pierre Mckenzie	SVM HeaderParse 0.1
AUTHOR AFFIL	y	SVM HeaderParse 0.2
AUTHOR NAME	Klaus Reinhardt	SVM HeaderParse 0.1
AUTHOR AFFIL	y	SVM HeaderParse 0.2
AUTHOR NAME	V Vinay	SVM HeaderParse 0.1
AUTHOR AFFIL	SAC; 1	SVM HeaderParse 0.2
ABSTRACT	Simpler proofs that DAuxPDA-TIME(polynomial) equals LOGDCFL and that SAC 1 equals LOGCFL are given which avoid Sudborough's multi-head automata [Sud78]. The first characterization of LOGDCFL in terms of polynomial proof-tree-size is obtained, using circuits built from the multiplex select gates of [FLR96]. The classes L and NC 1 are also characterized by polynomial size such circuits: "self-similar" logarithmic depth captures L, and bounded width captures NC 1 . 1 Introduction The class LOGCFL occupies a central place in the landscape of parallel complexity classes. LOGCFL sits between two interesting classes, NL and AC 1 : NL is often viewed as the space analog of NP, and AC 1 characterizes the problems solvable on a PRAM in O(log n) time using a polynomial number of processors. As a class, LOGCFL has attracted a lot of attention due to its seemingly "richer structure" than that of NL. The initial papers by Sudburough [Sud78] and Ruzzo [Ruz80] characterized LOGCFL using mul...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	In Proceedings of 5th Annual Internat. Conf. on Computing and Combinatorics (COCOON	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	194--203	INFERENCE
VOLUME	1627	INFERENCE
CITATIONS	17 found	ParsCit 1.0