{"entities":{"Q1079368":{"pageid":1090120,"ns":120,"title":"Item:Q1079368","lastrevid":66093186,"modified":"2026-04-12T07:30:10Z","type":"item","id":"Q1079368","labels":{"en":{"language":"en","value":"Superlinear speedup of an efficient sequential algorithm is not possible"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3963200"}},"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":"Q1079368$FD9963FF-F8B6-4D08-9EA1-778D578C687F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"56a119485750a814cccbd5363102c85363c174e0","datavalue":{"value":{"text":"Superlinear speedup of an efficient sequential algorithm is not possible","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1079368$0F61ED58-EA9D-4D8C-855B-1544A0181DE3","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a2050a180d910029fe4c0cf824a6fa2d1b048bae","datavalue":{"value":"0597.68044","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$D383D9DF-8B2A-41DF-8E26-8B3A295A4A7B","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cf5a8246ae0ce5e408006f39d2d043b88f52d299","datavalue":{"value":"10.1016/0167-8191(86)90024-4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$E7DDC8B7-142D-41B5-9B0A-1C32A21315B0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"977bffe0cdfc359126d9481609ed41a43eeb9d7e","datavalue":{"value":{"entity-type":"item","numeric-id":543986,"id":"Q543986"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079368$835767BB-A51C-4D43-805C-80A632DB4504","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"099052bf9729a5eb811471c0f1169dd8fb7b340d","datavalue":{"value":{"entity-type":"item","numeric-id":1079366,"id":"Q1079366"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079368$EC4F4B48-361E-4F16-845D-916D87582967","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3720432aef9951664363304ca43e047a368e5c74","datavalue":{"value":{"entity-type":"item","numeric-id":1079367,"id":"Q1079367"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079368$084ABB8D-079C-4C8D-AA19-9BD0C9160E15","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"eeac13f60c55bdb04ecb49274cc7b24a1688345d","datavalue":{"value":{"entity-type":"item","numeric-id":71527,"id":"Q71527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1079368$90F80477-D077-45CC-9F6F-9A58D5274536","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-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":"Q1079368$BD5FA2D9-FB71-46F1-AC04-BE428897E270","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$633372E2-1033-425C-8A2C-34EB8ECC6B9B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$48CE521D-80D0-4FF8-890E-515557AADD2C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"601c4d7b9a097760fe56a927241c9c9d725c7786","datavalue":{"value":"3963200","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$5F6D26E7-FAFB-4967-8469-8F3F5225F19D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"db5e0888fa9957c443e210eb3c88f717e276ae13","datavalue":{"value":"parallel processing","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079368$514C1F25-ED08-4CAA-ABFF-7EB23894D3BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0967c5f93d36d6aa18ee008d77ee288965d952b9","datavalue":{"value":"parallel algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1079368$2393F172-535B-4BC3-AE59-16F8259A66A5","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":"Q1079368$94469136-7BE7-4E12-9FD0-D07B8328D54E","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0b5c7cfaae4b0cb4c3e646832dbb7fa611eb96e2","datavalue":{"value":"https://doi.org/10.1016/0167-8191(86)90024-4","type":"string"},"datatype":"url"},"type":"statement","id":"Q1079368$E063F1CD-CA1B-469C-ACAC-581FFA37E6BA","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"69fb2cab2dc6df8f8d07ccb59eda851d0bf251b1","datavalue":{"value":"W2001020450","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1079368$B3E451FB-4389-4703-813A-7A0227B83D43","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Superlinear speedup of an efficient sequential algorithm is not possible","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Superlinear_speedup_of_an_efficient_sequential_algorithm_is_not_possible"}}}}}