{"@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/Q808692","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q808692","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q808692","kernelVersion":"v1","immutable":true,"modified":"2025-07-08T17:01:44Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q808692","name":"Statistical zero-knowledge languages can be recognized in two rounds","headline":"Statistical zero-knowledge languages can be recognized in two rounds","description":"scientific article; zbMATH DE number 4211490","url":"https://portal.mardi4nfdi.de/entity/Q808692","datePublished":"1991-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q808691"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1083474"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q107189"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0022-0000(91)90006-Q","url":"https://doi.org/10.1016/0022-0000(91)90006-Q"},"sameAs":["https://doi.org/10.1016/0022-0000(91)90006-Q"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1106840"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1108004"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5750398"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1259907"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4365519"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3833627"}]},"provenance":{"prov:generatedAtTime":"2025-07-08T17:01:44Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}