On quasilinear-time complexity theory

Author： Naik A.V.   Regan K.W.   Sivakumar D.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.148, Iss.2, 1995-09, pp. : 325-349

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Complexity of Time-Dependent Shortest Paths

By Foschini Luca   Hershberger John   Suri Subhash  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1075-1097

Springer Publishing Company

Access to resources Recommend Favorite

Entropy and algorithmic complexity in quantum information theory

By Benatti Fabio  

Natural Computing, Vol. 6, Iss. 2, 2007-06 ,pp. : 133-150

Springer Publishing Company

Access to resources Recommend Favorite

Effective category and measure in abstract complexity theory

By Calude C.   Zimand M.  

Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. : 307-327

Elsevier

Access to resources Recommend Favorite

Assembly time modelling through connective complexity metrics

By Mathieson James L.   Wallace Bradley A.   Summers Joshua D.  

International Journal of Computer Integrated Manufacturing, Vol. 26, Iss. 10, 2013-10 ,pp. : 955-967

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the expressivity and complexity of quantitative branching-time temporal logics

By Laroussinie F.   Schnoebelen P.   Turuani M.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 297-315

Elsevier

Access to resources Recommend Favorite