{"entities":{"Q6663025":{"pageid":14274182,"ns":120,"title":"Item:Q6663025","lastrevid":95977502,"modified":"2026-06-05T10:08:40Z","type":"item","id":"Q6663025","labels":{"en":{"language":"en","value":"Oblivious algorithms for the max-\\(k\\)AND problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7966924"}},"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":"Q6663025$52277F61-D16E-4417-AD4A-BDB2CF643712","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7e58c84fd26421fd5a7a683943565def087de87e","datavalue":{"value":{"text":"Oblivious algorithms for the max-\\(k\\)AND problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6663025$477BF7A6-DA8F-4B0C-A95B-2694742631A3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"82bf07e6c8bdaa395ba5c9daaaffa026df3f1f98","datavalue":{"value":{"entity-type":"item","numeric-id":6538689,"id":"Q6538689"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6663025$A4904CBA-5EAE-415A-8485-2F9ABAD76AB5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b939f7d6bb04335f584ac4f12e27b7d35776737c","datavalue":{"value":{"time":"+2025-01-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6663025$93027E38-0BB1-4BA0-84AF-08ACD94EC3AD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e01671c873d801b913451010c0981a684c101d40","datavalue":{"value":"68W20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663025$7BD99720-E4D9-4A04-BEBE-CEB278281F44","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663025$2F7836F6-A0C5-4E93-B582-15AA33A77E26","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663025$B7F73767-4A39-4A48-B7BF-630C05B73EC5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"afc6c1bc66dca258bdedbca8b6d5fdd62e94ba74","datavalue":{"value":"7966924","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663025$40E1D06E-6C5C-49A7-8774-A3FB2D42F076","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"16e0dca7ba9e53782ffa2b3bf0aa683e07fa8398","datavalue":{"value":"streaming algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663025$F34CE961-BFEE-44E0-A713-E1786AA980FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0de600cf8191fa1f423fd01c9a02b172072a7391","datavalue":{"value":"approximation algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663025$2841F7A9-3E78-41D4-B73B-041D1FE8081B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"44221a0d8132c72041097fdce5f7c7de1b604f4e","datavalue":{"value":"constraint satisfaction problem (CSP)","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663025$F8BA180C-4FB4-45C8-87E6-9B2183BD5CB3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ababbf4945ec27b963f024c1590cd07b66aa04c7","datavalue":{"value":"factor-revealing linear program","type":"string"},"datatype":"string"},"type":"statement","id":"Q6663025$C2F03882-46E4-4018-81A8-2940AD204071","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":"Q6663025$38A731F8-ABC7-4BF7-BE07-6A9D1B2806E9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"080ea4aad558612a0a7a61cbd21ff283c749ee6e","datavalue":{"value":"10.4230/LIPICS.APPROX/RANDOM.2023.15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6663025$B85FA7CB-CB8A-4E16-BF10-143BD0F6E1E5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Oblivious algorithms for the max-\\(k\\)AND problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Oblivious_algorithms_for_the_max-%5C(k%5C)AND_problem"}}}}}