Name
Abstract | ||
|---|---|---|
A nonuniform class called here Full-P/log, due to Ko, is studied. It corresponds to polynomial time with logarithmically long advice. Its importance lies in the structural properties it enjoys, more interesting than those of the alternative class P/log; specifically, its introduction was motivated by the need of a logarithmic advice class closed under polynomial-time deterministic reductions. Several characterizations of Full-P/log are shown, formulated in terms of various sorts of tally sets with very small information content. A study of its inner structure is presented, by considering the most usual reducibilities and looking for the relationships among the corresponding reduction and equivalence classes defined from these special tally sets. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1016/S0304-3975(98)00066-8 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
logarithmic advice complexity class | Journal | 207 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science | 6 |
PageRank | References | Authors |
0.76 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| José L. Balcázar | 1 | 701 | 62.06 |
| Montserrat Hermo | 2 | 55 | 10.77 |