{"entities":{"Q6826413":{"pageid":15098473,"ns":120,"title":"Item:Q6826413","lastrevid":55991743,"modified":"2026-02-24T10:48:54Z","type":"item","id":"Q6826413","labels":{"en":{"language":"en","value":"The complexity of computing minimal unidirectional covering sets"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6217430"}},"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":"Q6826413$75FF4D12-E529-4F89-812E-84672395E3E2","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"63621135deed7f4b7fcb8356347a5684e95e2fe5","datavalue":{"value":{"text":"The complexity of computing minimal unidirectional covering sets","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6826413$BE212C6E-1BF8-4FB5-9841-90E187EDEE49","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4aab7c99038f97234fd9570a6df082c058715adf","datavalue":{"value":"1286.68179","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6826413$245E2FF6-33E9-4DD7-8C14-64659498FB31","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"0ea9913dd3b997189f11d8cb369c4473f42648e2","datavalue":{"value":"10.1007/S00224-012-9437-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6826413$8FC0251B-8B92-4DE3-89FB-37C847619296","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba10b7d9d334d7784eeae994d9690d05d49ea0d8","datavalue":{"value":{"entity-type":"item","numeric-id":372956,"id":"Q372956"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$28F09105-995A-4C0E-87BC-7942DD394571","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ecac9e6eccb5837669e1403758ea819370179400","datavalue":{"value":{"entity-type":"item","numeric-id":250583,"id":"Q250583"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$1E977E6A-EC25-4B5F-8267-5CE029F239DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5989ffec9bf496d5cfd86e59aa63d6ac2e7cd455","datavalue":{"value":{"entity-type":"item","numeric-id":372957,"id":"Q372957"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$2E8123ED-10E7-435E-A7CD-E22EAB963C63","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e88be69c40b517dcf95562e728bf82dd0b4372ca","datavalue":{"value":{"entity-type":"item","numeric-id":372958,"id":"Q372958"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$AC578325-7E7B-4874-BAD4-64249B147EA7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"813ea56633814b981b20b79c4950ef61f792e6b4","datavalue":{"value":{"entity-type":"item","numeric-id":267647,"id":"Q267647"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$1EEC5018-F1E3-4396-B840-9C77EEF3BAE4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"b559743f011d61696dff04b2ecd3408df2541e49","datavalue":{"value":{"entity-type":"item","numeric-id":169698,"id":"Q169698"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6826413$4F5B4C91-8AF4-4BEC-9BC2-882BF8D53059","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"06bdca2898df413a78f8d2cdbb7311760f3e2760","datavalue":{"value":{"time":"+2013-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6826413$B7F560E1-EBF6-4216-941C-77C8A3042A4A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6826413$A3D7659C-7506-418E-9057-CC5116DD8D04","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"824cfdf2b129d72f7287008060b5bf497f3b4f34","datavalue":{"value":"91B14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6826413$96A5F326-0B95-4F19-8448-952C47C14047","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6ce721192d2e34e6736e556a3ca70a71d9de2a37","datavalue":{"value":"6217430","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6826413$405EB5D5-803D-447F-9319-D803901792A2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"afb0be73278dc37ad73b7ca7a0b69faa1ceea075","datavalue":{"value":"computational social choice","type":"string"},"datatype":"string"},"type":"statement","id":"Q6826413$884EECFD-FD19-4F72-83DB-7A8068F753D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2ba0cc3f7aaac8445724ef309c9eecb57f5a563d","datavalue":{"value":"computational complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6826413$7418504E-EB4C-49C4-90EA-B294A73EDBE5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"40061159c9f3b416db8264f618a120e6027cce79","datavalue":{"value":"minimal upward covering sets","type":"string"},"datatype":"string"},"type":"statement","id":"Q6826413$026B162B-FA7F-401F-970F-A053C39292E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1b107d233c6cdb670896cbf13cc82edc3f569c53","datavalue":{"value":"minimal downward covering sets","type":"string"},"datatype":"string"},"type":"statement","id":"Q6826413$A73A7812-7BFB-4F1B-BC3A-1E36014DF1C1","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":"Q6826413$BA7C2BF3-FAF6-4A07-8CFA-43E9699DEDC8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The complexity of computing minimal unidirectional covering sets","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_complexity_of_computing_minimal_unidirectional_covering_sets"}}}}}