Author： Jiang T. Timkovsky V.G.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.143, Iss.1, 1995-07, pp. : 113-122
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
A polynomial-time computable curve whose interior has a nonrecursive measure
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Access to resources
Recommend
Shortest common superstrings and scheduling with coordinated starting times
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
On the Complexity of Time-Dependent Shortest Paths
By Foschini Luca Hershberger John Suri Subhash
Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. :
Relating polynomial time to constant depth
By Vollmer H.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Criteria for Polynomial-Time (Conceptual) Clustering
By Pitt L.
Machine Learning, Vol. 02, Iss. 4, 1988-04 ,pp. :