{"@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/Q4044396","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4044396","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4044396","kernelVersion":"v1","immutable":true,"modified":"2026-02-05T09:28:54Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4044396","name":"Minimax Solutions for Linear Search Problems","headline":"Minimax Solutions for Linear Search Problems","description":"scientific article; zbMATH DE number 3458427","url":"https://portal.mardi4nfdi.de/entity/Q4044396","datePublished":"1974-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q532680"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2706070"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1137/0127002","url":"https://doi.org/10.1137/0127002"},"sameAs":["https://doi.org/10.1137/0127002"]},"provenance":{"prov:generatedAtTime":"2026-02-05T09:28:54Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}