A note on Schnorr's separatedness

DOI10.1016/0304-3975(77)90038-XMaRDI QIDQ1238422zbMATH OpenOpenAlexWikidataFDO

Authors Daniel Lehmann

Publication date 1977

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(77)90038-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A lower bound on the number of additions in monotone computations

This page was built for publication: A note on Schnorr's separatedness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238422)