Enumeration Reducibility with Polynomial Time Bounds

We investigate the efficiency of simulations of storages by several counters. A simulation of a pushdown store is described which is optimal in the sense that reducing the number of counters of a simulator leads to an increase in time complexity. The lower bound also establishes a tight counter hierarchy in exponential time. Then we turn to simulations of a set of counters by a different number of counters. We improve and generalize a known simulation in polynomial time. Greibach has shown that adding s + 1 counters increases the power of machines working in time ns. Using a new family of languages we show here a tight hierarchy result for machines with the same polynomial time-bound. We also prove hierarchies for machines with a fixed number of counters and with growing polynomial time-bounds. For machines with one counter and an additional "store zero" instruction we establish the equivalence of real-time and linear time. If at least two counters are available, the classes of languages accepted in real-time and linear time can be separated.

Download Full-text

A Polynomial-Time Algorithm for Computing Response Time Bounds in Static Priority Scheduling Employing Multi-linear Workload Bounds

2010 22nd Euromicro Conference on Real-Time Systems ◽

10.1109/ecrts.2010.27 ◽

2010 ◽

Cited By ~ 2

Author(s):

Steffen Stein ◽

Matthias Ivers ◽

Jonas Diemer ◽

Rolf Ernst

Keyword(s):

Response Time ◽

Polynomial Time ◽

Polynomial Time Algorithm ◽

Time Algorithm ◽

Priority Scheduling ◽

Time Bounds

Download Full-text

Polynomial Time Enumeration Reducibility

SIAM Journal on Computing ◽

10.1137/0207035 ◽

1978 ◽

Vol 7 (4) ◽

pp. 440-457 ◽

Cited By ~ 38

Author(s):

Alan L. Selman

Keyword(s):

Polynomial Time ◽

Enumeration Reducibility

Download Full-text

Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters

13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007) ◽

10.1109/rtcsa.2007.54 ◽

2007 ◽

Cited By ~ 8

Author(s):

Nathan Fisher ◽

Thi Huyen Chau Nguyen ◽

Joel Goossens ◽

Pascal Richard

Keyword(s):

Response Time ◽

Polynomial Time ◽

Polynomial Time Algorithms ◽

Time Bounds

Download Full-text

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

Sibirskii matematicheskii zhurnal ◽

10.33048/smzh.2019.60.208 ◽

2018 ◽

Vol 60 (2) ◽

pp. 360-375

Author(s):

A. V. Vasil'ev ◽

D. V. Churikov

Keyword(s):

Polynomial Time ◽

Transitive Group

Download Full-text

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.

Download Full-text