Read-once projections and formal circuit verification with binary decision diagrams

DOI10.1007/3-540-60922-9_40zbMath1379.68235OpenAlexW1807276935MaRDI QIDQ4593955

Ingo Wegener, Beate Bollig

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_40

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

A reducibility concept for problems defined in terms of ordered binary decision diagrams ⋮ Approximating Boolean functions by OBDDs ⋮ Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication ⋮ A reducibility concept for problems defined in terms of ordered binary decision diagrams ⋮ Completeness and non-completeness results with respect to read-once projections

This page was built for publication: Read-once projections and formal circuit verification with binary decision diagrams