Resource bounded randomness and computational complexity

Publisher： Elsevier

ISSN： 0304-3975

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

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 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

Resource bounded randomness and weakly complete problems

By Ambos-Spies K. Terwijn S.A. Xizhong Z.

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

Elsevier

Access to resources Recommend Favorite

Computational complexity of algorithms for MRP and JIT production planning problems in enterprise resource planning systems

By Miltenburg J.

Production Planning and Control, Vol. 12, Iss. 2, 2001-03 ,pp. : 198-209

Taylor & Francis Ltd

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 the Computational Complexity of P Automata

By Csuhaj-Varjú Erzsébet Ibarra Oscar Vaszil György

Natural Computing, Vol. 5, Iss. 2, 2006-05 ,pp. : 109-126

Springer Publishing Company

Access to resources Recommend Favorite