论文信息 - Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems - 字舞流文

Context-Free Grammars as a Tool for Describing Polynomial-Time Subclasses of Hard Problems

[1] David S. Johnson,et al. The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[2] Carlo Ghezzi,et al. Context-Free Graph Grammars , 1978, Inf. Control..

[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.