2 search results - page 1 / 1 » Distributionally-Hard Languages |
COCOON
1999
Springer
13 years 8 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
RTAS
2006
IEEE
13 years 10 months ago
2006
IEEE
Distributed hard real-time systems require guaranteed communication. One common approach is to restrict network access by enforcing a time-division multiple access (TDMA) schedule...