Publications
Filters: Author is E. Mayordomo [Clear All Filters]
[1298] P vs NP. Monografías de la Real Academia de Ciencias de Zaragoza. 26:57-68.
.
2004.
[1292] Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable. Theory of Computing Systems. 48:731-766.
.
2011.
[1369] Rebooting the human mitochondrial phylogeny: an automated and scalable methodology with expert knowledge. BMC Bioinformatics. 12:174(29pp.).
.
2011.
[HiLuMaSDNC] Scaled dimension and non uniform complexity. Journal of Computer and System Sciences. 69:97-122.
.
2004.
[sdkcthsR] Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets. Theory of Computing Systems. 43:471-497.
.
2008.
[1425] Special Issue: Computability in Europe 2010. Annals of Pure and Applied Logic. 163(6)
.
2012.
[1305] Special Issue: Computation and Logic in the Real World. Theory of Computing Systems. 45(4)
.
2009.
[LutMayTPRBMb] Twelve problems in resource bounded measure. Bulletin of the European Association for Theoretical Computer Science. 68:64-80.
.
1999.
[FeLuMaRe05] Weakly useful sequences. Information and Computation. 197:41-54.
.
2005.
[1307] Bounded Pushdown dimension vs Lempel Ziv information density. arXiv.
.
2007.
[1308] Resource-bounded Dimension in Computational Learning Theory. arXiv.
.
2010.
.
2011.
.
2011. .
1994.
- « first
- ‹ previous
- 1
- 2
- 3