{"@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/Q2931376","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2931376","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2931376","kernelVersion":"v1","immutable":true,"modified":"2025-11-25T14:50:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2931376","name":"Private approximation of search problems","headline":"Private approximation of search problems","description":"scientific article; zbMATH DE number 6373882","url":"https://portal.mardi4nfdi.de/entity/Q2931376","datePublished":"2014-11-25","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q290383"},{"@id":"https://portal.mardi4nfdi.de/entity/Q390162"},{"@id":"https://portal.mardi4nfdi.de/entity/Q271587"},{"@id":"https://portal.mardi4nfdi.de/entity/Q541667"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2931363"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1145/1132516.1132533","url":"https://doi.org/10.1145/1132516.1132533"},"sameAs":["https://doi.org/10.1145/1132516.1132533"]},"provenance":{"prov:generatedAtTime":"2025-11-25T14:50:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}