{"entities":{"Q6944026":{"pageid":21167742,"ns":120,"title":"Item:Q6944026","lastrevid":75948141,"modified":"2026-04-21T15:52:54Z","type":"item","id":"Q6944026","labels":{"en":{"language":"en","value":"A tight composition theorem for the randomized query complexity of partial functions (extended abstract)"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8078963"}},"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":"Q6944026$73849249-4DA2-42D3-BD59-01E8FE4E6A36","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4527783780301d91c95761bc468db0d0c7298fa4","datavalue":{"value":{"text":"A tight composition theorem for the randomized query complexity of partial functions (extended abstract)","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6944026$B8552544-35CE-499E-B694-A758A722209B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"4d18ffa95b731ddffc9b1267aadfd8aed93b7277","datavalue":{"value":"10.1109/FOCS46700.2020.00031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944026$EDD09F4B-1C3E-4198-A42C-283934139012","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"188f298856bd1ab34dfb6a9c57df560e36d0fc88","datavalue":{"value":{"entity-type":"item","numeric-id":273159,"id":"Q273159"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944026$D7CA64DC-5830-4B1E-BB8E-F1A315434A59","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"02e389074009f31bd892806ce08283889a673e97","datavalue":{"value":{"entity-type":"item","numeric-id":693003,"id":"Q693003"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6944026$BF577316-12AF-45CB-A90E-43FD259D222D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c757b9b7db25e8670dea572b24907796ea9667b","datavalue":{"value":{"time":"+2025-08-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6944026$D5CB6BC5-F875-4565-906E-AF6D640BD918","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944026$6C0FF631-5BEE-419D-B569-37CCA6A342EB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e5a7a604be21e1124c9955f07427678fa7a79fb2","datavalue":{"value":"8078963","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6944026$DEDFD74F-01C9-4CF5-8DC3-DA100D00DB14","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":"Q6944026$A72A5CE4-4E27-48B9-81E0-3CC727362927","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A tight composition theorem for the randomized query complexity of partial functions (extended abstract)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_tight_composition_theorem_for_the_randomized_query_complexity_of_partial_functions_(extended_abstract)"}}}}}