On Some Deterministic Space Complexity Problems

DOI10.1137/0211050zbMath0487.68037OpenAlexW2075322882MaRDI QIDQ3948589

Jia-Wei Hong

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211050

zbMATH Keywords

lower boundsBoolean expressionpolynomial over GF(2)cycle-free problemdeterministic space complete problemset of assignments

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

The complexity of searching implicit graphs ⋮ The complexity of searching succinctly represented graphs ⋮ On the space and circuit complexity of parameterized problems: classes and completeness

This page was built for publication: On Some Deterministic Space Complexity Problems