Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Approximation and Parameterized Complexity of Minimax Approval Voting

Uproszczony widok
dc.affiliationUniwersytet Warszawski
dc.conference.countryStany Zjednoczone
dc.conference.datefinish2017-02-09
dc.conference.datestart2017-02-04
dc.conference.placeSan Francisco
dc.conference.seriesNational Conference of the American Association for Artificial Intelligence
dc.conference.seriesNational Conference of the American Association for Artificial Intelligence
dc.conference.seriesshortcutAAAI
dc.conference.shortcutAAAI 2017
dc.conference.weblinkhttps://www.aaai.org/Conferences/AAAI/aaai17.php
dc.contributor.authorSocała, Arkadiusz
dc.contributor.authorCygan, Marek
dc.contributor.authorKowalik, Łukasz
dc.contributor.authorSornat, Krzysztof
dc.date.accessioned2024-01-24T16:55:18Z
dc.date.available2024-01-24T16:55:18Z
dc.date.issued2017
dc.description.financeNie dotyczy
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/101057
dc.identifier.weblinkhttp://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14554
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleApproximation and Parameterized Complexity of Minimax Approval Voting
dc.typeJournalArticle
dspace.entity.typePublication