scientific article
From MaRDI portal
Publication:3783219
zbMath0641.94028MaRDI QIDQ3783219
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lower boundsTuring machine complexitycomplexity measuresBoolean circuitsbranching programBoolean formuladirected switching networkundirected switching network
Related Items (6)
Comparing the sizes of nondeterministic branching read-k-times programs ⋮ What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ On almost bad Boolean bases ⋮ Branching Programs for Tree Evaluation ⋮ Lower bounds of the complexity of symmetric Boolean functions of contact- rectifier circuits ⋮ Unnamed Item
This page was built for publication:
