{"entities":{"Q2743964":{"pageid":2754703,"ns":120,"title":"Item:Q2743964","lastrevid":41959546,"modified":"2025-05-19T16:37:08Z","type":"item","id":"Q2743964","labels":{"en":{"language":"en","value":"The complexity of approximating a nonlinear program"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1648007"}},"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":"Q2743964$BD03FEEA-90A9-4D9F-82E7-CFD5789586D1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e2c8aeb19226993ac9ab9b8067dab00947f66602","datavalue":{"value":"0968.90527","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743964$235A49F4-B040-46D1-9F3D-6672AFEB0003","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a1f100798c61b0ceeb4781412ea9101bded8b187","datavalue":{"value":{"entity-type":"item","numeric-id":171914,"id":"Q171914"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743964$6C155ACA-79EC-404C-9578-5FAB91A04A11","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"50f140c30543ab3ec93eb55497d093eefa312e02","datavalue":{"value":{"entity-type":"item","numeric-id":814841,"id":"Q814841"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2743964$6FFA8F27-317A-417F-87FB-FA726698A85E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a12c476678ac830de6d391e0b3f53860587b6e09","datavalue":{"value":{"time":"+2001-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2743964$32915C3E-405B-4795-8C39-F2480D1C17E3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743964$4436BA1F-97BE-47C9-B992-B3A1464C0914","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743964$12CC1FFA-7433-4269-A846-A7584F8BFF4F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c5168c731b743960665b231fcbd4aa00268363e7","datavalue":{"value":"1648007","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2743964$6C8EA25D-1D4E-4923-84C2-8EFEB567F9B2","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":"Q2743964$2117F288-B427-49AC-9383-CF4B423CF056","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"97e83a53ea253bfef1ee4908c9b72d10cb9e7e32","datavalue":{"value":{"text":"The complexity of approximating a nonlinear program","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2743964$82662231-18DD-4AAC-AA28-FE7F530422AF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2743964","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2743964"}}}}}