Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
From MaRDI portal
Publication:1285764
DOI10.1016/S0020-0190(99)00007-1zbMath0917.68224MaRDI QIDQ1285764
Publication date: 28 April 1999
Published in: Information Processing Letters (Search for Journal in Brave)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Cites Work