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)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching is as easy as matrix inversion
- Properties that characterize LOGCFL
- A probabilistic remark on algebraic program testing
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Boolean complexity classes vs. their arithmetic analogs
- Making Nondeterminism Unambiguous
This page was built for publication: Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
