scientific article; zbMATH DE number 3571498

zbMath0366.68037MaRDI QIDQ4142695

Ivan Hal Sudborough

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items

Cyclic automata ⋮ Unnamed Item ⋮ Alternating multihead finite automata ⋮ Weighted hypertree decompositions and optimal query plans ⋮ Subclasses of \textsc{Ptime} interpreted by programming languages ⋮ Tree-size bounded alternation ⋮ P-hardness of the emptiness problem for visibly pushdown languages ⋮ On uniform circuit complexity ⋮ Properties that characterize LOGCFL ⋮ Interactive proof systems and alternating time-space complexity ⋮ Hypertree decompositions and tractable queries ⋮ Restricted space algorithms for isomorphism on bounded treewidth graphs ⋮ Computing LOGCFL certificates ⋮ Uniform Constraint Satisfaction Problems and Database Theory ⋮ Bandwidth constraints on problems complete for polynomial time