scientific article
From MaRDI portal
Publication:3340148
zbMath0548.68040MaRDI QIDQ3340148
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
The complexity of combinatorial problems with succinct input representation, Circuit satisfiability and constraint satisfaction around Skolem arithmetic, Emptiness problems for integer circuits, Unnamed Item, Equivalence problems for circuits over sets of natural numbers, Integer circuit evaluation is PSPACE-complete, Satisfiability of Algebraic Circuits over Sets of Natural Numbers