{"entities":{"Q1111377":{"pageid":1122126,"ns":120,"title":"Item:Q1111377","lastrevid":66688599,"modified":"2026-04-12T11:59:37Z","type":"item","id":"Q1111377","labels":{"en":{"language":"en","value":"A practical algorithm for Boolean matrix multiplication"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4076614"}},"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":"Q1111377$BD0BD8B6-3F52-4FF0-98A9-8E903555AB65","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c236d0c692ff108bb9b69678babb04da16275037","datavalue":{"value":{"text":"A practical algorithm for Boolean matrix multiplication","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1111377$EDED3ACB-625C-466E-B683-409D8B1129DA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"67d489006cb7aae129522dd6b9d322639e1d42e2","datavalue":{"value":"0658.68046","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$6FF6D2F1-E50E-4037-9BE2-285FEED60538","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0ee496e1fe018b4b38900f01056e7fe67b1c875d","datavalue":{"value":"10.1016/0020-0190(88)90130-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$03DAADDC-A41F-42D9-8660-193075CEBA4D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b568fdac40d481abc1c48bdc7b2a892581f92b24","datavalue":{"value":{"entity-type":"item","numeric-id":1111376,"id":"Q1111376"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$278A3B20-C7C4-46F8-B4CA-692B7C1B81FF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"db6df3606e104c2161180e2597803fd70c72d072","datavalue":{"value":{"entity-type":"item","numeric-id":557817,"id":"Q557817"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$D2BA4954-4E95-4E1E-B455-F8A0FB85248D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$0376AEF0-8814-4256-B86C-7638532C1402","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1111377$09439713-E999-4A84-89B8-609022DF22FF","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"77d7a2919506b6881cb23dc710863f879f254ccb","datavalue":{"value":"An algorithm is given for multiplying two \\(n\\times n\\) Boolean matrices. It has time complexity \\(O(n^ 3/(\\log n)^{1.5})\\) and requires n \\(log_ 2 n\\) bits of auxiliary storage.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111377$7DB3F27F-17E2-46FA-950D-A2C4D06B7D4A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$4683ABCC-A564-4267-AE70-19D6DD0C1DD3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6be78f1bad1f2f19058dbde65eb124c0430a7d27","datavalue":{"value":"68W30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$6D94FBC1-3EF2-4407-AFC6-7C703F40B18D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"72309745094959b676ca20810c7af21a33fe24b5","datavalue":{"value":"65F30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$1F601689-9874-499D-8A4E-05C1C99D97BF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"12374b0f66149459afcc05ca6882e8c317965820","datavalue":{"value":"4076614","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$D98D5AEF-0CAF-42D8-B73F-650580A876E2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"aba72f7a50c6331fc87e2da0e7087379a0bbc676","datavalue":{"value":"Boolean matrix multiplication","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111377$C0D4A08C-15FF-4804-84E5-676934BCB637","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c6e730fc6bcb55a5fff6f14fa60dd9c5891a7cd3","datavalue":{"value":"time versus storage tradeoffs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111377$7D08224C-864C-41C2-A736-1A3D36EB7EC8","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":"Q1111377$7AB297B9-21F2-4B76-A50B-BE183DD430E0","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"b9a1dbe9f3994d705b1498d47be423e59dce79fa","datavalue":{"value":"https://doi.org/10.1016/0020-0190(88)90130-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q1111377$0D02AF0C-814B-48D6-A409-A0EA678C65B9","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"4b822daf3d4bb03aded1e1982274f55898c4d36a","datavalue":{"value":"W2035038443","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111377$F3D12DC4-78F6-47F2-A4F2-4FCEDA303884","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"57500c8428a56bb0e1efe6d9a0a10137d68d2a1c","datavalue":{"value":{"entity-type":"item","numeric-id":1251068,"id":"Q1251068"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$58C6923A-3A92-4837-BBBB-8B5C44950BAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dd3a7cfeece8562a9ac87120b107e2b528967937","datavalue":{"value":{"entity-type":"item","numeric-id":4773298,"id":"Q4773298"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$CD5AED4D-16A8-4A44-805D-980989B4B58D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c164f040680170f3ed5985371f5714b4c12ab924","datavalue":{"value":{"entity-type":"item","numeric-id":5616735,"id":"Q5616735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$E10B345F-6A9D-493B-80C0-1B7B2401AC08","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"963e349d630bc45bbd901f2c99ed2c9ce92235e0","datavalue":{"value":{"entity-type":"item","numeric-id":4745257,"id":"Q4745257"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$010E1AAE-7FA0-476C-90D1-65E87C723B77","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5ded654f0815096f77df444976277cd94c4893af","datavalue":{"value":{"entity-type":"item","numeric-id":1068514,"id":"Q1068514"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$DE5B83B2-6876-431A-AA9B-EEA21191FA2E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7a6030b36d8e5c354770b6a8c9a91f5a75bf452e","datavalue":{"value":{"entity-type":"item","numeric-id":761038,"id":"Q761038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111377$D83E1D98-E930-4085-8216-06F94A89202A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A practical algorithm for Boolean matrix multiplication","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_practical_algorithm_for_Boolean_matrix_multiplication"}}}}}