Boolean functional synthesis: hardness and practical algorithms (Q2050108)

From MaRDI portal
Revision as of 05:41, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Boolean functional synthesis: hardness and practical algorithms
scientific article

    Statements

    title
    Boolean functional synthesis: hardness and practical algorithms (English)
    0 references
    author
    S. Akshay
    0 references
    Supratik Chakraborty
    0 references
    Shubham Goel
    0 references
    Sumith Kulal
    0 references
    Shetal Shah
    0 references
    publication date
    30 August 2021
    0 references
    zbMATH Keywords
    Boolean functional synthesis
    0 references
    Skolem functions
    0 references
    expansion-based algorithms
    0 references
    describes a project that uses
    ABC
    0 references
    CAQE
    0 references
    GitHub
    0 references

    Identifiers

    zbMATH DE Number
    7388005
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2050108&oldid=26683186"
    Powered by MediaWiki