Boolean complexity classes vs. their arithmetic analogs
From MaRDI portal
Publication:4894604
DOI<99::AID-RSA7>3.0.CO;2-6 10.1002/(SICI)1098-2418(199608/09)9:1/2<99::AID-RSA7>3.0.CO;2-6zbMath0873.94035OpenAlexW2014852889MaRDI QIDQ4894604
Publication date: 7 October 1996
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<99::aid-rsa7>3.0.co;2-6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
The complexity of planarity testing ⋮ Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Dual VP classes ⋮ Space complexity of perfect matching in bounded genus bipartite graphs ⋮ Green's theorem and isolation in planar graphs ⋮ Compressed Decision Problems in Hyperbolic Groups. ⋮ Derandomizing Isolation in Space-Bounded Settings ⋮ Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
This page was built for publication: Boolean complexity classes vs. their arithmetic analogs
