Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions

2017 ◽  
pp. 176-191 ◽  
Author(s):  
Tomoyuki Yamakami
Keyword(s):  
Linear Space ◽  
Polynomial Time ◽  
Graph Connectivity

scholarly journals An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space

2019 ◽  
Vol 21 (3) ◽  
pp. 325-349 ◽  
Author(s):  
John Fearnley ◽  
Sanjay Jain ◽  
Bart de Keijzer ◽  
Sven Schewe ◽  
Frank Stephan ◽  
...  
Keyword(s):  
Linear Space ◽  
Polynomial Time ◽  
Parity Games

The 2-closure of a 32-transitive group in polynomial time

2018 ◽  
Vol 60 (2) ◽  
pp. 360-375
Author(s):  
A. V. Vasil'ev ◽  
D. V. Churikov
Keyword(s):  
Polynomial Time ◽  
Transitive Group

Learning Importance of Preferences

10.29007/v68w ◽  
2018 ◽  
Author(s):  
Ying Zhu ◽  
Mirek Truszczynski
Keyword(s):  
Polynomial Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Scoring Rules ◽  
Np Hard ◽  
Individual Preferences

We study the problem of learning the importance of preferences in preference profiles in two important cases: when individual preferences are aggregated by the ranked Pareto rule, and when they are aggregated by positional scoring rules. For the ranked Pareto rule, we provide a polynomial-time algorithm that finds a ranking of preferences such that the ranked profile correctly decides all the examples, whenever such a ranking exists. We also show that the problem to learn a ranking maximizing the number of correctly decided examples (also under the ranked Pareto rule) is NP-hard. We obtain similar results for the case of weighted profiles when positional scoring rules are used for aggregation.

Sign in / Sign up

Export Citation Format

Share Document