One-Input-Face MPCVP Is Hard for L, But in LogDCFL
From MaRDI portal
Publication:5385973
DOI10.1007/11944836_8zbMath1177.68099OpenAlexW2181189727MaRDI QIDQ5385973
Samir Datta, Tanmoy Chakraborty
Publication date: 17 April 2008
Published in: FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11944836_8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators ⋮ A generalization of Spira's theorem and circuits with small segregators or separators ⋮ Planar and grid graph reachability problems ⋮ On the Complexity of Sandpile Prediction Problems
This page was built for publication: One-Input-Face MPCVP Is Hard for L, But in LogDCFL
