{"entities":{"Q1097685":{"pageid":1108437,"ns":120,"title":"Item:Q1097685","lastrevid":69635067,"modified":"2026-04-13T08:21:21Z","type":"item","id":"Q1097685","labels":{"en":{"language":"en","value":"Modeling recursion with the aid of iterative algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4035107"}},"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":"Q1097685$4CF693C3-FBC2-4C92-924B-AD6253E6FC27","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"54bd611bb6a733b8aa0ae41eb8bbb5f7adda3339","datavalue":{"value":{"text":"Modeling recursion with the aid of iterative algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1097685$44C15ADA-649F-42E1-B4B7-8F23FD757EF6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"78e418651444800eb7a2226d7138cab6087c9c3c","datavalue":{"value":"0635.68006","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1097685$187FCCC0-9776-404E-9993-9F08379C9EED","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"01e383059d089b558899a8ff12dc1874a3fc5fd0","datavalue":{"value":{"entity-type":"item","numeric-id":1097684,"id":"Q1097684"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1097685$DCB6ED46-5EA3-418D-8BAC-4A00DA3C7520","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ab835ee823091d1ceba22c60aa80cb8715e52e75","datavalue":{"value":{"entity-type":"item","numeric-id":585662,"id":"Q585662"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1097685$FFCC4FB0-47DA-4876-A3B8-2AAA133036C3","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"be953c7743ad681cffb55322e552c5990c03cfb7","datavalue":{"value":{"entity-type":"item","numeric-id":174054,"id":"Q174054"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1097685$93A0AE87-440A-4572-A534-2BE0BDF4C251","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"63df7153432d81fa42019fcabb076c89649b0b5b","datavalue":{"value":{"time":"+1986-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":"Q1097685$3BCA4718-51A1-4C5A-A140-C614DF7B502F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"a876dfaf70295acc72b6be843a20e0e3b36c73f4","datavalue":{"value":"A recursive nonlinear program scheme is described allowing efficient iterative representation. Examples are cited of the application of the proposed method of recursion elimination to the towers of Hanoi problems, merge sorting, and tree traversal.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$A4D959D9-72EE-4792-AA10-29044091E80A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"7cfff2e3b7f009b69ae82e4aa296ae1902bd02ff","datavalue":{"value":"68Q60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1097685$6F501D45-EB5C-4F88-B07F-7BE485FA7CC4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8e3f40e3cc87753c4e0b7d7ce4bdc00805f626f","datavalue":{"value":"68N01","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1097685$D83BC8AA-8DB1-46D6-9D72-9A94C329BE1B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3f97694d44af155a68434cb72eabc6a4d5dd5227","datavalue":{"value":"68P10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1097685$0C3CE5B6-98EE-43D5-BC86-E1A46E4F8925","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"29beb14e0232591b8bab2a593e64b94c0343e88e","datavalue":{"value":"4035107","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1097685$AE7DE6D8-81FB-4A70-B92E-FCA739A33A61","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"479ec35f5029b0f1b1595d094eec1d63c6af2685","datavalue":{"value":"recursive nonlinear program scheme","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$A264869E-9AC8-465A-8B68-BB838D68FC1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0c5c57abad5be5e82dd354d8e7e0278c867bbedc","datavalue":{"value":"iterative representation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$3784AFC9-8D0F-4CE7-9F86-D857AD92BCD1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2cd35abdadd73ccbf621b9c9a0df46d0eee081ca","datavalue":{"value":"towers of Hanoi","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$CFB36637-050F-44A5-B390-1F0CD6282F29","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6398c29847f9e5b5061416873694ba72013c870d","datavalue":{"value":"merge sorting","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$C8470D70-72B8-4002-80D3-9E0630648EF3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"882eb54c2b2470fe48263e9f9d634336ac692531","datavalue":{"value":"tree traversal","type":"string"},"datatype":"string"},"type":"statement","id":"Q1097685$22F9D77C-04AF-4CC9-ABC5-ED5AAD02D0D4","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":"Q1097685$2D157681-B2D0-40E5-90BC-AB51E749C33D","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cad56d3091dde1687eab4bb50d432c21f98c86b8","datavalue":{"value":{"entity-type":"item","numeric-id":4367527,"id":"Q4367527"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"db897eea0565789d331ba0a42925606b95df372b","datavalue":{"value":{"amount":"+0.7576402425765991","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1097685$2DDC7BD9-6FA2-4C86-BE5C-37A05CBF4C83","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ec1bc381bce980d1d00f646c974e142baf1801bd","datavalue":{"value":{"entity-type":"item","numeric-id":3479520,"id":"Q3479520"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"d9a6bbe3ed8985d9645983378b88010da1dc3382","datavalue":{"value":{"amount":"+0.7560283541679382","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1097685$37895565-108D-4C85-98A8-9F82A44EE152","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1f2309ebebb0ae4ce068690f5fe68fe98e8a9780","datavalue":{"value":{"entity-type":"item","numeric-id":1185010,"id":"Q1185010"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5c639b04bf69f80f946183a7dafad8432bcafc69","datavalue":{"value":{"amount":"+0.7544682621955872","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1097685$26032146-DA58-449A-9699-2542C7A048D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6eb751ed6e63591fb75d965374d3115cb1efe44e","datavalue":{"value":{"entity-type":"item","numeric-id":1067772,"id":"Q1067772"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"473913d40207ca5d3086a2aac1821a9919b0a642","datavalue":{"value":{"amount":"+0.7529070973396301","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1097685$0F799D2B-BD97-45FD-860F-2C5CDAB81080","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cd6968a81a46cb23ffdf28686e7d3d34e11f0a14","datavalue":{"value":{"entity-type":"item","numeric-id":3339243,"id":"Q3339243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c4511fc034cca3289e02975aa4ce73345a545eba","datavalue":{"value":{"amount":"+0.7403925061225891","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1097685$86B22DC6-DC6D-4F38-8CF8-6016480BB7D6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Modeling recursion with the aid of iterative algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Modeling_recursion_with_the_aid_of_iterative_algorithms"}}}}}