scientific article; zbMATH DE number 1222575
From MaRDI portal
Publication:4218113
zbMath0914.94027MaRDI QIDQ4218113
Publication date: 27 June 1999
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 (2)
On the minimum number of negations leading to super-polynomial savings ⋮ On the negation-limited circuit complexity of merging
This page was built for publication:
