Name
Abstract | ||
|---|---|---|
The logarithmic advice class, Full-P/log, is known to coincide with the class of languages that are polynomial time reducible to special “easy” tally sets. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58338-6_87 | MFCS |
Keywords | Field | DocType |
easy tally sets,polynomial time | Discrete mathematics,Computer science,Reduction (recursion theory),Logarithm,Time complexity | Conference |
ISBN | Citations | PageRank |
3-540-58338-6 | 2 | 0.40 |
References | Authors | |
10 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Montserrat Hermo | 1 | 55 | 10.77 |