On polynomial time graph grammars

2006 ◽  
pp. 227-236 ◽  
Author(s):  
Franz J. Brandenburg
Keyword(s):  
Polynomial Time ◽  
Graph Grammars ◽  
Time Graph

Isomorphism Testing via Polynomial-Time Graph Extensions

2010 ◽  
Vol 10 (2) ◽  
pp. 119-143 ◽  
Author(s):  
Daniel Cosmin Porumbel
Keyword(s):  
Polynomial Time ◽  
Time Graph

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.

On the Expressiveness of Context-Sensitive Graph Grammars

2012 ◽  
Vol 23 (7) ◽  
pp. 1635-1655 ◽  
Author(s):  
Yang ZOU ◽  
Jian LÜ ◽  
Chun CAO ◽  
Hao HU ◽  
Wei SONG ◽  
...  
Keyword(s):  
Graph Grammars ◽  
Context Sensitive

scholarly journals Learn your opponent's strategy (in polynomial time)!

1996 ◽  
pp. 164-176 ◽  
Author(s):  
Yishay Mor ◽  
Claudia V. Goldman ◽  
Jeffrey S. Rosenschein
Keyword(s):  
Polynomial Time
Sign in / Sign up

Export Citation Format

Share Document