scientific article; zbMATH DE number 1256664
From MaRDI portal
Publication:4230351
zbMath0977.68545MaRDI QIDQ4230351
Don Coppersmith, Baruch Schieber
Publication date: 16 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items (2)
On a relation between the depth and complexity of monotone Boolean formulas ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO
This page was built for publication:
