scientific article
From MaRDI portal
Publication:3340147
zbMath0548.68039MaRDI QIDQ3340147
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (12)
More complicated questions about maxima and minima, and some closures of NP ⋮ The complexity of membership problems for circuits over sets of integers ⋮ The difference and truth-table hierarchies for NP ⋮ The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems ⋮ Hierarchically specified unit disk graphs ⋮ Computational complexity of long paths and cycles in faulty hypercubes ⋮ Parsing Boolean grammars over a one-letter alphabet using online convolution ⋮ Satisfiability of algebraic circuits over sets of natural numbers ⋮ Hierarchically specified unit disk graphs ⋮ Linear connectivity problems in directed hypergraphs ⋮ Emptiness Problems for Integer Circuits ⋮ Balance problems for integer circuits
This page was built for publication:
