The code problem for traces -- improving the boundaries

Author： Hoogeboom H.J.   Muscholl A.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Problem Difficulty and Code Growth in Genetic Programming

By Gustafson Steven   Ekárt Anikó   Burke Edmund   Kendall Graham  

Genetic Programming and Evolvable Machines, Vol. 5, Iss. 3, 2004-09 ,pp. : 271-290

Springer Publishing Company

Access to resources Recommend Favorite

Improving a fixed parameter tractability time bound for the shadow problem

By Heusch P.   Porschen S.   Speckenmeyer E.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 772-788

Elsevier

Access to resources Recommend Favorite

The topology of Mazurkiewicz traces

By Kummetz R.   Kuske D.  

Theoretical Computer Science, Vol. 305, Iss. 1, 2003-08 ,pp. : 237-258

Elsevier

Access to resources Recommend Favorite

Event Structures for Local Traces

By Kleijn H.C.M.   Morin R.   Rozoy B.  

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 2, 2004-01 ,pp. : 1-16

Elsevier

Access to resources Recommend Favorite

Logical definability on infinite traces

By Ebinger W.   Muscholl A.  

Theoretical Computer Science, Vol. 154, Iss. 1, 1996-01 ,pp. : 67-84

Elsevier

Access to resources Recommend Favorite