{"entities":{"Q6065268":{"pageid":13199552,"ns":120,"title":"Item:Q6065268","lastrevid":102306314,"modified":"2026-06-06T04:08:42Z","type":"item","id":"Q6065268","labels":{"en":{"language":"en","value":"The complexity of constrained min-max optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7765262"}},"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":"Q6065268$E31A48DA-91ED-4105-9D58-A5A67E6FEB1A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8e75828e6291f8d2c487bff6fabe4236e4b5fa9d","datavalue":{"value":{"text":"The complexity of constrained min-max optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6065268$F714B1B2-B5FB-4345-B24E-BDE6CB761B6D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"33a07e31253438f314a15b95790f2b733b26353e","datavalue":{"value":"10.1145/3406325.3451125","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065268$FC0CD4C8-975C-4C77-8863-C648AC7950AE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"efd2a9aaf12c8e9491873ed3dbb7ce681d41188b","datavalue":{"value":{"entity-type":"item","numeric-id":458481,"id":"Q458481"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065268$2F90A851-5096-4384-9CF4-5BD1AACA930B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"055973d795216469e52f862506a58b0cc99b3e27","datavalue":{"value":{"entity-type":"item","numeric-id":681864,"id":"Q681864"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065268$0AF0EA14-7679-4614-AD1F-3C639F0BF32C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"89ae38ce7d2b008f40e91055e9ac6240dfadf979","datavalue":{"value":{"entity-type":"item","numeric-id":4575858,"id":"Q4575858"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065268$A069D521-1441-4EAA-9FD5-33C1B5955194","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e1daac321441bd98d8a8a605c8e52de8430f356b","datavalue":{"value":{"entity-type":"item","numeric-id":6065162,"id":"Q6065162"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6065268$8ECCB04C-0522-4706-9B00-8D04B3A4E86E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"a57f772c7334dce3f7920e528999b803f662d580","datavalue":{"value":{"time":"+2023-11-14T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6065268$86530260-CFFB-43B6-A544-61AF98E1B0D6","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"696fe033358a76b72b6bca1e3bd358de46a90847","datavalue":{"value":"https://arxiv.org/abs/2009.09623","type":"string"},"datatype":"url"},"type":"statement","id":"Q6065268$3BBA1039-59AE-4D15-98F3-EAB5C3D27268","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"f969879f531643f058f8dd4c87a7dd4eb7b8c4c8","datavalue":{"value":"68Qxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065268$B7E14D8B-3327-4433-8DF6-8FC318B1574C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"a965a6aa4d0bfd54016af83cb76ac4d7088c8e80","datavalue":{"value":"7765262","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065268$DE62704F-FF60-443D-8402-147153ABEF70","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e62559a04f580a77ee3676b3a7230a2f2addaa32","datavalue":{"value":"PPAD","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065268$592785D3-3EBD-46DE-B33B-1BF7F21F3B5E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"645f355bfce2b56ddcc0a50b9d76eb626f7374fb","datavalue":{"value":"TFNP","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065268$A862211F-9B0C-4838-9A60-B2949BF8C431","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"459f564ab19946f2e9daf3310997ffae74ee69fe","datavalue":{"value":"black-box lower bounds","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065268$1EE73613-4CDD-4BA3-8387-4AF35D3ADA80","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065268$29418EB9-C37E-4C41-AEE0-302642ED63C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cd08feb599ffa7bdb9f4fc0b69fb99870b109332","datavalue":{"value":"min-max optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6065268$C92B6FD4-466D-48E2-8125-11F87CA29979","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":"Q6065268$C1517932-4225-49A3-8F24-ECD919BA98B8","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"c03126ca4a6628f79bbbc482ce3b41bd74367b88","datavalue":{"value":"W3168185438","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6065268$5B8881B9-C6ED-41F9-837A-A7120C80D2AC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The complexity of constrained min-max optimization","badges":[]}}}}}