Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with LogDCFL:
TR06-130 | 27th September 2006
Tanmoy Chakraborty, Samir Datta

One-input-face MPCVP is Hard for L, but in LogDCFL

A monotone planar circuit (MPC) is a Boolean circuit that can be
embedded in a plane, and that has only AND and OR
gates. Yang showed that the one-input-face
monotone planar circuit value problem (MPCVP) is in NC^2, and
Limaye et. al. improved the bound to ... more >>>

ISSN 1433-8092 | Imprint