{"@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/Q675225","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q675225","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q675225","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T13:34:46Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q675225","name":"Inductive counting for width-restricted branching programs","headline":"Inductive counting for width-restricted branching programs","description":"scientific article; zbMATH DE number 988050","url":"https://portal.mardi4nfdi.de/entity/Q675225","datePublished":"1997-03-06","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q675224"},{"@id":"https://portal.mardi4nfdi.de/entity/Q198230"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q259032"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1006/INCO.1996.0084","url":"https://doi.org/10.1006/INCO.1996.0084"},"sameAs":["https://doi.org/10.1006/INCO.1996.0084"]},"provenance":{"prov:generatedAtTime":"2025-12-25T13:34:46Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}