Parameterized complexity of basic decision problems for tree automata

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.90, Iss.6, 2013-06, pp. : 1150-1170

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

Circuit and Decision Tree Complexity of Some Number Theoretic Problems

By Bernasconi A. Damm C. Shparlinski I.

Information and Computation, Vol. 168, Iss. 2, 2001-08 ,pp. : 113-124

Academic Press

Access to resources Recommend Favorite

On the parameterized complexity of the Multi-MCT and Multi-MCST problems

By Chen Wenbin Schmidt Matthew Samatova Nagiza

Journal of Combinatorial Optimization, Vol. 21, Iss. 2, 2011-02 ,pp. : 151-158

Springer Publishing Company

Access to resources Recommend Favorite

Describing parameterized complexity classes

By Flum J. Grohe M.

Information and Computation, Vol. 187, Iss. 2, 2003-12 ,pp. : 291-319

Elsevier

Access to resources Recommend Favorite

Basic Properties of Quantum Automata

By Gudder S.

Foundations of Physics, Vol. 30, Iss. 2, 2000-02 ,pp. : 301-319

Springer Publishing Company

Access to resources Recommend Favorite

On The Parameterized Intractability Of Motif Search Problems*

By Fellows Michael Gramm† Jens Niedermeier‡ Rolf

Combinatorica, Vol. 26, Iss. 2, 2006-04 ,pp. : 141-167

Springer Publishing Company

Access to resources Recommend Favorite