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.
[BooMay96] On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
.
1996.
[HerMay94] A note on polynomial size circuits with low resource bounded Kolmogorov complexity. Mathematical Systems Theory. 27:247-356.
.
1994.
[BalMay95] A note on genericity and bi immunity. :193-196.
.
1995.
[MayMP] Measuring in PSPACE. 6:93-100.
.
1994.
[LutMayMSDHL] Measure stochasticity and the density of hard languages. SIAM Journal on Computing. 23:762-779.
.
1994.
[LutMayMSDHLb] Measure stochasticity and the density of hard languages. 665:38-47.
.
1993.
[MayKCCCHD] A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters. 84:1-3.
.
2002.
[1297] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Theory of Computing Systems. 51:229-247.
.
2012.
[1302] Inseparability and Strong Hypotheses for Disjoint NP Pairs. Twenty-Seventh Symposium on Theoretical Aspects of Computer Science (STACS'10).
.
2010.
[HiLuMa05] The fractal geometry of complexity classes. SIGACT News. 36:24-38.
.
2005.
[DaLaLuMaFSD] Finite state dimension. Theoretical Computer Science. 310:1-33.
.
2004.
[DaLaLuMaFSDb] Finite state dimension. 2076:1028-1039.
.
2001.
[1309] Exhaustive mitochondrial phylogenetics: challenges and solutions. 9th Workshop on Algorithms in Bioinformatics (WABI 2009).
.
2009.
[BuhMay97] An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
.
1997.
[BuhMay95] An excursion to the Kolmogorov random strings. :197-203.
.
1995.
[AtHiLuMa06] Effective strong dimension in algorithmic information and computational complexity. SIAM Journal on Computing. 37:671-705.
.
2007.
[ESDAICC] Effective Strong Dimension in Algorithmic Information and Computational Complexity. 2996:632-643.
.
2004.
[MayEHD] Effective Hausdorff dimension. Trends in Logic. 23:171-186.
.
2004.
[EFDAIT] Effective fractal dimension in algorithmic information theory. :259-285.
.
2008.
[DPSSFc] Dimensions of Points in Self-Similar Fractals. 5092:215-224.
.
2008.
[DPSSF] Dimensions of points in self-similar fractals. SIAM Journal on Computing. 38:1080-1112.
.
2008.
[1438] Dimension spectra of random subfractals of self-similar fractals. Ninth International Conference on Computability and Complexity in Analysis (CCA 2012).
.
2012.
[LoMa05] Dimension is Compression. 3618:676-685.
.
2005.
[1439] Dimension is Compression. Theory of Computing Systems. 52:95-112.
.
2013.