{"@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/Q4156871","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4156871","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4156871","kernelVersion":"v1","immutable":true,"modified":"2025-04-12T01:52:39Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4156871","name":"An             <i>O(n)</i>             algorithm for determining a near-optimal computation order of matrix chain products","headline":"An             <i>O(n)</i>             algorithm for determining a near-optimal computation order of matrix chain products","description":"scientific article; zbMATH DE number 3587168","url":"https://portal.mardi4nfdi.de/entity/Q4156871","datePublished":"1978-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q328688"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q56730"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1145/359545.359556","url":"https://doi.org/10.1145/359545.359556"},"sameAs":["https://doi.org/10.1145/359545.359556"]},"provenance":{"prov:generatedAtTime":"2025-04-12T01:52:39Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}