{"entities":{"Q2215910":{"pageid":2226653,"ns":120,"title":"Item:Q2215910","lastrevid":71576529,"modified":"2026-04-13T23:10:10Z","type":"item","id":"Q2215910","labels":{"en":{"language":"en","value":"On the computational complexity of the range computation problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7285514"}},"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":"Q2215910$4D8C351E-84FD-4ADB-A68E-5944696DAE0D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6de95ba49892f1e59b2bd56178a4651cc67797af","datavalue":{"value":{"text":"On the computational complexity of the range computation problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2215910$C4B0BA15-3D56-4947-8A76-1072DAFADBEF","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f40f455d18c23c5bef28fc24fc3232727df51739","datavalue":{"value":"10.1007/978-3-030-31041-7_15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2215910$4666148A-4CAB-4EBC-B364-3FC19D834F7B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"01f808d6ed2273e81fa02df15336b948d7d3d2f5","datavalue":{"value":{"entity-type":"item","numeric-id":1868529,"id":"Q1868529"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2215910$56735122-1794-4327-BE6C-7E3FCBCCD63F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b92018b86948792c7af58198ad3b3a15967a211f","datavalue":{"value":{"time":"+2020-12-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2215910$84C147BE-EA37-4227-A079-5A236EDC1EEF","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1f66a3c6f6c4263d812ea49e5394cac6ea83ef9b","datavalue":{"value":"68T37","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2215910$D15DE986-E18D-487C-A5E8-FEE87608632C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f97fba5676bc93b42e60378f9b93f82fe277fb7f","datavalue":{"value":"7285514","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2215910$F69768B5-F4FB-488F-A487-2201829C0704","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":"Q2215910$57745909-1E4F-4B8D-99EB-A8B64C8F4FB4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"1b2031c5bc957961f97320ef790b2239a466c18c","datavalue":{"value":"https://doi.org/10.1007/978-3-030-31041-7_15","type":"string"},"datatype":"url"},"type":"statement","id":"Q2215910$501A29A7-EEF1-4224-8412-2BA8AC6461ED","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7326b7b54b12f7a18f4f1c5c74ae61dd67d26b1d","datavalue":{"value":"W3007047307","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2215910$F752AE64-3481-4E42-A26D-9178EBBB19A1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On the computational complexity of the range computation problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_the_computational_complexity_of_the_range_computation_problem"}}}}}