The Complexity of the Kn,n-Problem for Node Replacement Graph Languages

Author： Skodinis K.  

Publisher： Academic Press

ISSN： 0890-5401

Source： Information and Computation, Vol.168, Iss.2, 2001-08, pp. : 95-112

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

A Multiscale Wavelet Solver with O(n) Complexity

By Williams J.R.   Amaratunga K.  

Journal of Computational Physics, Vol. 122, Iss. 1, 1995-11 ,pp. : 30-38

Academic Press

Access to resources Recommend Favorite

On Computing Signatures of k-out-of-n Systems Consisting of Modules

By Da Gaofeng   Xia Lvyu   Hu Taizhong  

Methodology And Computing In Applied Probability, Vol. 16, Iss. 1, 2014-03 ,pp. : 223-233

Springer Publishing Company

Access to resources Recommend Favorite

Quasirecognition by prime graph of finite simple groups L n (2) and U n (2)

By Khosravi Behrooz   Moradi Hossein  

Acta Mathematica Hungarica, Vol. 132, Iss. 1-2, 2011-07 ,pp. : 140-153

Springer Publishing Company

Access to resources Recommend Favorite

Gauss Sums for O(2n+1, q)

By Cohen D.S.S.D.  

Finite Fields and Their Applications, Vol. 4, Iss. 1, 1998-01 ,pp. : 62-86

Academic Press

Access to resources Recommend Favorite

The linear polarization constant of Rn

By Matolcsi Máté  

Acta Mathematica Hungarica, Vol. 108, Iss. 1-2, 2005-07 ,pp. : 129-136

Springer Publishing Company

Access to resources Recommend Favorite