{"entities":{"Q6909444":{"pageid":20958523,"ns":120,"title":"Item:Q6909444","lastrevid":75609658,"modified":"2026-04-20T08:53:25Z","type":"item","id":"Q6909444","labels":{"en":{"language":"en","value":"A linguistic characterization of bounded oracle computation and probabilistic polynomial time"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112227"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909444$9A60509A-4573-408A-953C-B2E64C878FF8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"eaf0bf34b1ae7fca8a522fcea0fc927139c48f5c","datavalue":{"value":{"text":"A linguistic characterization of bounded oracle computation and probabilistic polynomial time","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909444$DDB45D0F-85AF-4C56-B504-4A1E1A5C424F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8f8643ca5ab9818127113c6be18e494b833645cc","datavalue":{"value":"10.1109/SFCS.1998.743523","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909444$7EED786C-A8F4-4DB2-A015-5D5066B8998A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a7b0bfbbcf5657a8b101c8d9d79e6747c41c0556","datavalue":{"value":{"entity-type":"item","numeric-id":276486,"id":"Q276486"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909444$354D2F4E-C946-4D0A-93EB-ED90A7ED5F8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"183df695ae89db8e2a7647ddbe2de62ff0deb022","datavalue":{"value":{"entity-type":"item","numeric-id":1052316,"id":"Q1052316"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909444$18E722AB-E39E-43EA-A575-B46C2E7F82BB","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"f80243e0d658df0800175c27a0c68fc83245b007","datavalue":{"value":"M. Mitchell","type":"string"},"datatype":"string"},"type":"statement","id":"Q6909444$8A1CCA9D-35DB-4F72-9DF1-61A67A6D3A85","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909444$537582AC-25D8-488F-AA89-26032E40ECD6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909444$5899C864-7E63-4419-93F8-4BC06F803320","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"29f9e48c8c6a087133b62b32938127014736666f","datavalue":{"value":"8112227","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909444$A0CBEAD4-08CB-4A7E-A4BE-180E96CFB5DB","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909444$4422E22E-F937-4514-BB5C-7C23F0C35B77","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A linguistic characterization of bounded oracle computation and probabilistic polynomial time","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_linguistic_characterization_of_bounded_oracle_computation_and_probabilistic_polynomial_time"}}}}}