{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4863976","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4863976","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4863976","kernelVersion":"v1","immutable":true,"modified":"2026-01-01T14:33:16Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4863976","name":"Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy","headline":"Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy","description":"scientific article; zbMATH DE number 838846","url":"https://portal.mardi4nfdi.de/entity/Q4863976","datePublished":"1996-07-02","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q430842"},{"@id":"https://portal.mardi4nfdi.de/entity/Q178716"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2706174"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/S0895480190283595","url":"https://doi.org/10.1137/S0895480190283595"},"sameAs":["https://doi.org/10.1137/S0895480190283595"]},"provenance":{"prov:generatedAtTime":"2026-01-01T14:33:16Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}