z-logo
open-access-imgOpen Access
SDDs Are Exponentially More Succinct than OBDDs
Author(s) -
Simone Bova
Publication year - 2016
Publication title -
proceedings of the ... aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v30i1.10107
Subject(s) - binary decision diagram , boolean function , computer science , exponential function , representation (politics) , binary number , theoretical computer science , polynomial , discrete mathematics , algorithm , mathematics , arithmetic , mathematical analysis , politics , political science , law

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here