Functions realizable with word-parallel logical and two's-complement addition instructions

DOI10.1145/359605.359632MaRDI QIDQ4139678zbMATH OpenOpenAlexFDO

Authors Henry S. jun. Warren

Publication date 1977

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359605.359632

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cited in

(2)

• Approximate bit dependency analysis to identify program synthesis problems as infeasible
• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

This page was built for publication: Functions realizable with word-parallel logical and two's-complement addition instructions

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