Publication:3751515
From MaRDI portal
zbMath0609.94018MaRDI QIDQ3751515
Publication date: 1986
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
Related Items
Entropy of contact circuits and lower bounds on their complexity, Lower bounds for depth-restricted branching programs, Unnamed Item, Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access