{"entities":{"Q3309063":{"pageid":3319771,"ns":120,"title":"Item:Q3309063","lastrevid":80811290,"modified":"2026-05-06T17:03:14Z","type":"item","id":"Q3309063","labels":{"en":{"language":"en","value":"A Parallel Algorithm for the Knapsack Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3839317"}},"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":"Q3309063$D238B507-44A0-4834-AFBD-0C979F56DC0D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"49e03a3e3462541861b1d36d98e9b4cfaa27f14a","datavalue":{"value":{"text":"A Parallel Algorithm for the Knapsack Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3309063$314DCFF6-B80E-45EB-9A27-D31B68B89E77","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"224698bbd634a8cf0cc7b9e3595d216eb8911ef6","datavalue":{"value":"0528.68028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$605B5509-5B9E-4413-9799-0E7AD849028F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3c8f4d2ff8b9ab99453c724aa9361cfa35082377","datavalue":{"value":"10.1109/TC.1984.1676456","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$E617FC28-8823-4385-B3FB-53A3FBA84354","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba2a2badda79aaea22d3ff12394111020d85b93e","datavalue":{"value":{"entity-type":"item","numeric-id":3309062,"id":"Q3309062"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3309063$A6DD99CD-4863-49A3-8D4F-E065BAE1C4C5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cb95ba1181f89055fe808aa2c36bea9d3930d0fc","datavalue":{"value":{"entity-type":"item","numeric-id":80442,"id":"Q80442"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3309063$513DA2DF-0FB5-4DDA-8A29-75EB584C12ED","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ee0f220147ae8bc749a64db56839865dbc4f127","datavalue":{"value":{"time":"+1984-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":"Q3309063$35DE19CA-7104-4384-AF1D-350EBA560FE6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$30859CB3-8547-4D10-B537-ABFC5C11497F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$80F79CB2-11CC-4AE0-8776-2B287955A0FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ec3769495799f08479987ac368adf64f125a2b66","datavalue":{"value":"68N25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$1AC52F9B-3C35-41B2-80EE-843ED574C7C0","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"73283551cb3945a69cf3531b067e5ad965cbdd12","datavalue":{"value":"3839317","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3309063$92411DC2-C720-42D7-AB50-6CC1551FDEA8","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d54d97c9d74a7974164bd27bc3725f50a6bd71c8","datavalue":{"value":"cryptography","type":"string"},"datatype":"string"},"type":"statement","id":"Q3309063$BA88CE70-7AED-479B-ACB7-72A012688F21","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bd9f81e2de676ca1bc7efadeabffd39fb5463e86","datavalue":{"value":"knapsack problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3309063$525DF499-18ED-4AD8-B950-8CE9F4737467","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b2e5b69ec7a610a633f8c630801231eb2a3e5afb","datavalue":{"value":"parallel architecture","type":"string"},"datatype":"string"},"type":"statement","id":"Q3309063$3385AA01-0EAE-43EE-BB96-B92B7A272756","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6b58d47a07e8a5c4d8e99bdef6e9c3e2b7298513","datavalue":{"value":"time-memory- processor tradeoff","type":"string"},"datatype":"string"},"type":"statement","id":"Q3309063$EC286255-EA02-48DE-8374-EB266BBA2C1A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"242880358d852e2151bb467fd3f5f7b4459f7bb9","datavalue":{"value":"VLSI complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q3309063$A98455DF-59FF-4295-9860-3CB2B9764F6C","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":"Q3309063$7ED7DBF3-218A-4257-8683-C52F5E93BA6C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Parallel Algorithm for the Knapsack Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Parallel_Algorithm_for_the_Knapsack_Problem"}}}}}