SCOPUS 정보 검색 플랫폼

Volumn 287, Issue 2, 2002, Pages 473-499

Faster exact solutions for some NP-hard problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

RECURSIVE ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0037190359 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00257-2 Document Type: Conference Paper

Times cited : (16)

References (11)

1
- 0027700467
- On space-efficient algorithms for certain NP-complete problems
- (1993) Theoret. Comput. Sci. , vol.120 , pp. 311-315
- Ferreira, A.¹

3
- 0032284428
- Two new upper bounds for SAT
- January
- (1998) Proc. Ninth ACM-SIAM Symp. on Discrete Algorithms , pp. 512-530
- Hirsch, E.A.¹

4
- 0022787854
- 0.304n) algorithm for solving maximum independent set problem
- (1986) IEEE Trans. Commun. , vol.35 , pp. 847-851
- Jian, T.¹

6
- 0022025456
- n steps
- (1985) Discrete Appl. Math. , vol.10 , pp. 287-295
- Monien, B.¹ Speckenmeyer, E.²

7
- 0001038743
- Algorithms for maximum independent sets
- (1986) J. Algorithms , vol.7 , pp. 425-440
- Robson, J.M.¹

8
- 0018053728
- The complexity of satisfiability problems
- (1978) Proc. 10th ACM Symp. on Theory of Computing , pp. 216-226
- Schaefer, T.J.¹

9
- 0033331493
- A probabilistic algorithm for k-SAT and constraint satisfaction problems
- (1999) Proc. 40th IEEE Symp. on Foundations of Computer Science , pp. 410-414
- Schöning, I.¹

10
- 0001539550
- n/4) algorithm for certain NP-complete problems
- (1981) SIAM J. on Computing , vol.10 , pp. 456-464
- Schroeppel, R.¹ Shamir, A.²

11
- 0001513435
- Finding a maximum independent set
- (1977) SIAM J. Comput. , vol.6 , pp. 537-546
- Tarjan, R.E.¹ Trojanowski, A.E.²

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