{"@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/Q2968091","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2968091","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2968091","kernelVersion":"v1","immutable":true,"modified":"2026-04-03T17:14:09Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2968091","name":"AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS","headline":"AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS","description":"scientific article; zbMATH DE number 6693725","url":"https://portal.mardi4nfdi.de/entity/Q2968091","datePublished":"2017-03-09","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2668564"},{"@id":"https://portal.mardi4nfdi.de/entity/Q487003"},{"@id":"https://portal.mardi4nfdi.de/entity/Q223957"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.20382/JOCG.V3I1A9","url":"https://doi.org/10.20382/JOCG.V3I1A9"},"sameAs":["https://doi.org/10.20382/JOCG.V3I1A9"]},"provenance":{"prov:generatedAtTime":"2026-04-03T17:14:09Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}