Resource bounded randomness and weakly complete problems

Author： Ambos-Spies K.   Terwijn S.A.   Xizhong Z.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.172, Iss.1, 1997-02, pp. : 195-207

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

Resource bounded randomness and computational complexity

By Wang Y.  

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 33-55

Elsevier

Access to resources Recommend Favorite

The bounded-complete hull of an -space

By Ershov Y.L.  

Theoretical Computer Science, Vol. 175, Iss. 1, 1997-03 ,pp. : 3-13

Elsevier

Access to resources Recommend Favorite

On resource-bounded instance complexity

By Fortnow L.   Kummer M.  

Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. : 123-140

Elsevier

Access to resources Recommend Favorite

Executable specifications of resource-bounded agents

By Fisher Michael  

Autonomous Agents and Multi-Agent Systems, Vol. 21, Iss. 3, 2010-11 ,pp. : 368-396

Springer Publishing Company

Access to resources Recommend Favorite

On Bounded Leg Shortest Paths Problems

By Roditty Liam   Segal Michael  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 583-600

Springer Publishing Company

Access to resources Recommend Favorite