scientific article
From MaRDI portal
Publication:3815525
zbMath0664.68038MaRDI QIDQ3815525
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (1)
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
This page was built for publication: