Publications
Filters: Author is E. Mayordomo [Clear All Filters]
[1293] Curves that must be retraced. Information and Computation. 209:992--1006.
.
2011.
[1301] Curves that must be retraced. Sixth International Conference on Computability and Complexity in Analysis (CCA 2009).
.
2009.
[LutMayCVKL] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. Theoretical Computer Science. 164:141-163.
.
1996.
[LutMayCVKLb] Cook versus Karp Levin Separating Completeness Notions If NP Is Not Small. 775:415-426.
.
1994.
.
1994.
[1426] Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports. 2(1)
.
2012.
[AmMaZh96] A Comparison of Weak Completeness Notions. :171-178.
.
1996.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[1310] Building maintainable, exhaustive human mitochondrial phylogenies. 17 Annual International Conference on Intelligent Systems for Molecular Biology/8th European Conference.
.
2009.
[1307] Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
.
2007.
.
2011.
.
2011.
[AESETPBI] Almost every set in exponential time is P-bi-immune. 629:392-400.
.
1992.
[MayAESET] Almost every set in exponential time is P bi immune. Theoretical Computer Science. 136:487-506.
.
1994. - « first
- ‹ previous
- 1
- 2
- 3