{"@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/Q1158751","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1158751","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1158751","kernelVersion":"v1","immutable":true,"modified":"2025-07-16T00:42:47Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1158751","name":"Bounded query machines: on NP and PSPACE","headline":"Bounded query machines: on NP and PSPACE","description":"scientific article; zbMATH DE number 3742621","url":"https://portal.mardi4nfdi.de/entity/Q1158751","datePublished":"1981-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q593774"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q123643"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0304-3975(81)90061-X","url":"https://doi.org/10.1016/0304-3975(81)90061-X"},"sameAs":["https://doi.org/10.1016/0304-3975(81)90061-X"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4086709"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1253656"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5645036"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3856099"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1251069"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1249438"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1158752"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1394124"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2537313"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4142696"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1815323"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4154070"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2542726"}]},"provenance":{"prov:generatedAtTime":"2025-07-16T00:42:47Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}