{"entities":{"Q6829618":{"pageid":15117637,"ns":120,"title":"Item:Q6829618","lastrevid":56019718,"modified":"2026-02-24T14:54:08Z","type":"item","id":"Q6829618","labels":{"en":{"language":"en","value":"An optimal lower bound on the communication complexity of gap-Hamming-distance"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6134262"}},"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":"Q6829618$D69B9C28-486B-4C8D-952E-23AF94F246F6","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"14770b77fc4911b9137cede39085cd669564ca6e","datavalue":{"value":{"text":"An optimal lower bound on the communication complexity of gap-Hamming-distance","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6829618$68D70800-BAAC-4AC2-BE38-637251548342","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"d86f1adddcc72e6135f09d413489dc85f026dd8b","datavalue":{"value":"1259.68087","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$9FD7524D-F586-43D9-A3D0-46E03FDF855E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e08a28f32d8bfd6c28761c9eb3bae1529b982314","datavalue":{"value":"10.1137/120861072","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$C2D78C07-8656-4051-BF5D-C77C644C8B9D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"626aed7bf886773fb43cc46aa42082b69ff659e1","datavalue":{"value":{"entity-type":"item","numeric-id":343860,"id":"Q343860"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829618$BEE91B95-D525-42CE-8965-BA0187AD5DE5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d9f6b5d26f49366977cda1349aa1fe24902e4163","datavalue":{"value":{"entity-type":"item","numeric-id":375694,"id":"Q375694"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829618$710F95EA-0756-42A2-99CE-A3E5C4C07CD5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c2a1c45d0f0997786c62faf9f7fcd603424632e8","datavalue":{"value":{"entity-type":"item","numeric-id":84798,"id":"Q84798"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6829618$F4FA9C56-C25B-4492-A507-12CA0BD2C263","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3303370592b590ea2daf77b34dbd2db9a539c4a2","datavalue":{"value":{"time":"+2013-02-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6829618$972223C8-8052-444F-B6D5-9611CDF5BB55","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$DA5FDEFA-4015-4A45-97D7-4D7E33A201F5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0dd26fa594336927a7a04e8147a405d69e5da239","datavalue":{"value":"68Q87","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$EC432CD3-6AFA-4125-B6A2-E0FB37CD0383","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"99e75c38935b147cca2a0eac1e86993c645e76a5","datavalue":{"value":"94A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$52B1E0EF-2456-4245-A93B-D9A2898368B1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b0f92b11e84d4c37c0bc0d8dad8d618830c8f195","datavalue":{"value":"6134262","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6829618$81EE59A5-ACA2-4589-8965-A31D650563BB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7d59f9270ba2c0b3161162dab212fcc774a42eba","datavalue":{"value":"communication complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$FF294AA9-4C7A-49B2-9188-BAD48D921347","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"696d1090a13d6e38cd11e36e831d214f7f21345c","datavalue":{"value":"corruption","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$EF2664D1-E2BF-4EE7-9EB4-C3FD3F1DC0DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c8a4705fb72c24781f28685359fd87f282d5c06e","datavalue":{"value":"data streams","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$34064AFD-A8D9-43DA-952C-1CBD523737AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"95b1639589e4cf6a6cf4d1aeb2674ee6c6f56d6f","datavalue":{"value":"gap-Hamming-distance","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$E438C53F-086C-43B0-A50B-4E340C1FDA75","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"95ec17bdf163661b2e63a7c4fca1f87a7afe63f3","datavalue":{"value":"Gaussian noise correlation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$5A67CE41-691A-4FA6-BEEC-53CF8BCC5A8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0e0192fb524376f45dfdd3eb1a809bf3cd5a9489","datavalue":{"value":"lower bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q6829618$CB9DC267-5EBC-4224-AD0A-CEA875151D62","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":"Q6829618$EBA2A3A2-4EA2-417F-BC36-1427A4DE8F6B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An optimal lower bound on the communication complexity of gap-Hamming-distance","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_optimal_lower_bound_on_the_communication_complexity_of_gap-Hamming-distance"}}}}}