Author： Dunne P.E. Gibbons A. Zito M.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.249, Iss.2, 2000-10, pp. : 243-263
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Theoretical Computer Science, Vol. 290, Iss. 3, 2003-01 ,pp. :
Access to resources
Recommend
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Statistical mechanics methods and phase transitions in optimization problems
Theoretical Computer Science, Vol. 265, Iss. 1, 2001-08 ,pp. :
Bitcoin: A Search-Theoretic Approach
International Journal of Innovation in the Digital Economy (IJIDE), Vol. 6, Iss. 2, 2015-04 ,pp. :
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science, Vol. 163, Iss. 1, 1996-08 ,pp. :