Publication:4029623

zbMath0767.94026MaRDI QIDQ4029623

R. G. Nigmatullin

Publication date: 28 March 1993

zbMATH Keywords

lower bounds; complexity theory; Boolean circuits; computational resources; combinational complexity; Boolean Function

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

03D15: Complexity of computation (including implicit computational complexity)