Open AccessOn the Complexity of mCP-nets
Author(s) -
Thomas Lukasiewicz,
Enrico Malizia
Publication year - 2016
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v30i1.10039
Subject(s) - exptime , p , voting , polynomial hierarchy , computational complexity theory , theoretical computer science , computer science , weighted voting , hierarchy , time complexity , upper and lower bounds , complexity class , discrete mathematics , pspace , mathematics , combinatorics , algorithm , mathematical analysis , politics , political science , economics , law , market economy
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom