{"entities":{"Q6560890":{"pageid":14172045,"ns":120,"title":"Item:Q6560890","lastrevid":99881273,"modified":"2026-06-05T20:55:12Z","type":"item","id":"Q6560890","labels":{"en":{"language":"en","value":"Optimal coding theorems in time-bounded Kolmogorov complexity"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7870302"}},"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":"Q6560890$CE05C551-8881-4329-B814-B667AF000B1A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"09879274d089e97b0a8f5379e8986219d44974dc","datavalue":{"value":{"text":"Optimal coding theorems in time-bounded Kolmogorov complexity","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6560890$13723976-D03E-4C0B-BE0C-4D268E36FBDF","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9f670497f3128c3a7e93dacf82b05360aa0f11f5","datavalue":{"value":{"entity-type":"item","numeric-id":4978007,"id":"Q4978007"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560890$4C5B2262-9B3F-494D-9C6B-AED66D7F69F8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7805073a5ae9040c991641317a6d3bbe630dcf22","datavalue":{"value":{"entity-type":"item","numeric-id":2125079,"id":"Q2125079"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560890$1A11BB2E-5D3F-4ECB-AFD6-EE4A86AC84AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d750fc05251a9f31c6a44ffc6c9d2225a4eea35b","datavalue":{"value":{"entity-type":"item","numeric-id":290243,"id":"Q290243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6560890$3357BB2F-723D-4AE9-A4C8-D5A201BD65C8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"aad9968298383135691f4dcdd005dbce68275c0d","datavalue":{"value":{"time":"+2024-06-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6560890$A9551178-30AC-4120-A260-F71688B10E57","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1a86519cb3571ebce07f2774b2a00a0f17e12c3e","datavalue":{"value":"68Nxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560890$2772B2BD-D35F-434D-9E86-EDAD0DCEBB69","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560890$2B6B8D2D-0370-4DB9-BD7C-E6BDB74E2136","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1026e4c0fea8801926a0a304218d7e3eca066d3a","datavalue":{"value":"7870302","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560890$A278CF9B-8B4D-4184-B8AF-DDE2E8D6B601","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560890$714EF9AE-B90E-443D-ACB3-8F571DBE9265","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"49eb4dac5aeb1a5fd4804122c81f369b6968def6","datavalue":{"value":"randomized algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560890$2EB642E3-A571-492D-9A79-43F1780B8D35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1e343c0d066d632a0b869d2dadad72cc8a3999e1","datavalue":{"value":"Kolmogorov complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6560890$6A5C249E-EB9B-43E3-8D7C-F9E9FB7AD117","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":"Q6560890$E1205721-559E-434B-9750-6BD28E75F26F","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"551da54e2323009fc72bd37b926effdaea23c52f","datavalue":{"value":"10.4230/LIPICS.ICALP.2022.92","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6560890$71F840FB-3E87-43F8-9173-C457B5503332","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal coding theorems in time-bounded Kolmogorov complexity","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_coding_theorems_in_time-bounded_Kolmogorov_complexity"}}}}}