{"entities":{"Q1365684":{"pageid":1376424,"ns":120,"title":"Item:Q1365684","lastrevid":68559186,"modified":"2026-04-13T00:33:19Z","type":"item","id":"Q1365684","labels":{"en":{"language":"en","value":"Complexity theory and theory of algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1058457"}},"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":"Q1365684$3314AF1A-A5B9-4761-AE5E-909867C7E285","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"80d8662db68c401a279d727990f8f6e0a03d2b13","datavalue":{"value":{"text":"Complexity theory and theory of algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1365684$29971759-0155-491F-A84A-9DFA59CB2480","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"74fa5c285c0b2bd11232fcc233d17bb1fc6b404b","datavalue":{"value":"0878.00033","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$E2D88A94-0167-4CEB-9F24-4FDA926525DC","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1365684$1E4E67F9-CE87-4732-8B93-2463F73C7248","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"98d05246fb651b2121ff35b1d998bd53dacc3ab0","datavalue":{"value":{"time":"+1997-11-30T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1365684$C34EB414-E84D-475B-A2F9-24D1C41ABB94","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"99d94fcb96b4922701764df17c7515acf0422aef","datavalue":{"value":"The articles of this volume will be reviewed individually.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1365684$112711E0-AEFE-435D-A0D7-FC1815CAF5FE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"342a6161f41187e2c595daa41b09cee10ab1ace9","datavalue":{"value":"00B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$5DEE1110-C45A-4A08-8B17-BB7000736F31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$11919D76-5FE5-46F2-8F28-3EE245FDAD78","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de3565cfd3393000dd87ca545f95ff84d4c1446","datavalue":{"value":"68W10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$A61818E0-B641-4DEC-A70F-41D3F7832893","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e243fd7c22ca7737465c92434b0b01e09fe89c42","datavalue":{"value":"68Q30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$363F1C08-2788-4925-A83D-725850D7F03D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"11f59d485def4eee8e703e673e775b6a6db7bce5","datavalue":{"value":"1058457","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1365684$14F4BF44-83FD-47E2-A91B-1D7C4F0609FD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6bb8ff692d33f378eade91f71371280b64cdd398","datavalue":{"value":"Complexity theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q1365684$6AB61707-0AD8-4C2D-88E2-F14FD61C4755","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8baf804bc4c1172cd32c9cc96b06a8c070f11c0c","datavalue":{"value":"Algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1365684$D5A63A0D-2D2C-417A-9CF1-6CEE7809CC5D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"30079201549958701bc79bc36ae8a8054f2abdac","datavalue":{"value":"Special issue","type":"string"},"datatype":"string"},"type":"statement","id":"Q1365684$DD7B87C2-87A0-4827-A1AA-682965DACD6A","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":"Q1365684$FA359498-371E-4D62-ABEF-0C480E08DA6D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Complexity theory and theory of algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Complexity_theory_and_theory_of_algorithms"}}}}}