SCOPUS 정보 검색 플랫폼

Volumn 188, Issue 1-2, 1997, Pages 129-159

Complexity of tile rotation problems

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

TILE ROTATION PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 0031270477 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(96)00291-5 Document Type: Article

Times cited : (5)

References (12)

1
- 0346143332
- Thèse docteur ingenieur, IMAG, U. de Grenoble, France
- F. Barahona, Application de l'optimisation combinatoire a certains modeles de verres de spins: complexité et simulations, Thèse docteur ingenieur, IMAG, U. de Grenoble, France, 1980.
- (1980) Application de l'Optimisation Combinatoire a Certains Modeles de Verres de Spins: Complexité et Simulations
- Barahona, F.¹

2
- 0001051761
- On the computational complexity of Ising spin glass models
- F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A: Math. Gen. 15 (1982) 3241-3253.
- (1982) J. Phys. A: Math. Gen. , vol.15 , pp. 3241-3253
- Barahona, F.¹

3
- 85059770931
- The complexity of theorem-proving procedures
- S.A. Cook, The complexity of theorem-proving procedures, Proc. ACM STOC, 3 (1971) 151-158.
- (1971) Proc. ACM STOC , vol.3 , pp. 151-158
- Cook, S.A.¹

4
- 0028500410
- On the solvability of domino snake problems
- Y. Etzion-Petruschka, D. Harel, On the solvability of domino snake problems, Theoret. Comput. Sci. 131 (1994) 243-269.
- (1994) Theoret. Comput. Sci. , vol.131 , pp. 243-269
- Etzion-Petruschka, Y.¹ Harel, D.²

5
- 0003603813
- Freeman, San Francisco
- M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 0022525716
- Effective transformations on infinite trees with applications to high undecidability, dominoes and fairness
- D. Harel, Effective transformations on infinite trees with applications to high undecidability, dominoes and fairness, J. ACM 33 (1986) 224-248.
- (1986) J. ACM , vol.33 , pp. 224-248
- Harel, D.¹

7
- 0347404222
- Internal Report
- P. Laroche, Planar 1-in-3 satisfiability is NP-complete, Internal Report, 1992.
- (1992) Planar 1-in-3 Satisfiability Is NP-complete
- Laroche, P.¹

8
- 84991920015
- Complexity of solvable cases of the decision problem for predicate calculus
- H. Lewis, Complexity of solvable cases of the decision problem for predicate calculus, in: Proc. 19th Symp. on Foundations of Computer Science, 1978, pp. 35-47.
- (1978) Proc. 19th Symp. on Foundations of Computer Science , pp. 35-47
- Lewis, H.¹

9
- 0348142315
- Engineering Thesis, Depto. Ingeniería Matemática, U. de Chile
- M. Matamala, Complejidad de redes neuronales no lineales y aplicaciones a la optimización, Engineering Thesis, Depto. Ingeniería Matemática, U. de Chile, 1991.
- (1991) Complejidad de Redes Neuronales no Lineales y Aplicaciones a la Optimización
- Matamala, M.¹

10
- 0346773688
- Engineering Thesis, Depto. Ingeniería Matemática, U. de Chile
- I. Rapaport, Complejidad de embaldosados finitos del plano, Engineering Thesis, Depto. Ingeniería Matemática, U. de Chile, 1995.
- (1995) Complejidad de Embaldosados Finitos del Plano
- Rapaport, I.¹

12
- 84944488797
- Proving theorems by pattern recognition II
- H. Wang, Proving theorems by pattern recognition II, Bell System Tech. J. 40 (1961) 1-41.
- (1961) Bell System Tech. J. , vol.40 , pp. 1-41
- Wang, H.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.