{"entities":{"Q6209480":{"pageid":13346271,"ns":120,"title":"Item:Q6209480","lastrevid":98844557,"modified":"2026-06-05T18:37:29Z","type":"item","id":"Q6209480","labels":{"en":{"language":"en","value":"Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900050334"}},"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":"Q6209480$A6DB224F-3EC3-4B39-A870-260456020DB0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"71085060c06a47010b85af820e4c4587cb10b4eb","datavalue":{"value":{"time":"+2008-05-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6209480$A9F9FDB8-0644-4D7A-9118-5D56F535755F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2056fb0794b3154f9140c36f8f410228bf57d4e5","datavalue":{"value":{"entity-type":"item","numeric-id":1760802,"id":"Q1760802"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6209480$5CA11FD3-20DA-4430-8C48-A4C7F8FA96EB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"38af61132c7f46859e8bf8b4d28881b625dba276","datavalue":{"value":{"entity-type":"item","numeric-id":161960,"id":"Q161960"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6209480$11B64DFE-2D0A-4DCD-92A4-49F9BD19B1A7","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"10e95a41ffeef8c2b07fa02c91f1407e84bab850","datavalue":{"value":"900050334","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6209480$E1E64F9F-6B3B-4495-B662-B2D1DE5101C7","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":"Q6209480$A74E1A49-9D3C-47F3-9251-8941CE5D4D74","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parallel Branch and Bound Algorithm for Computing Maximal Structured Singular Value","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Parallel_Branch_and_Bound_Algorithm_for_Computing_Maximal_Structured_Singular_Value"}}}}}