{"@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/Q4674584","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q4674584","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q4674584","kernelVersion":"v1","immutable":true,"modified":"2026-04-04T17:59:50Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q4674584","name":"Quantum communication complexity of symmetric predicates","headline":"Quantum communication complexity of symmetric predicates","description":"scientific article; zbMATH DE number 2168339","url":"https://portal.mardi4nfdi.de/entity/Q4674584","datePublished":"2005-05-17","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1370854"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2710693"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1070/IM2003V067N01ABEH000422","url":"https://doi.org/10.1070/IM2003V067N01ABEH000422"},"sameAs":["https://doi.org/10.1070/IM2003V067N01ABEH000422"]},"provenance":{"prov:generatedAtTime":"2026-04-04T17:59:50Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}