Average polynomial time complexity of some NP-complete problems
Work
Year: 1986
Type: article
Source: Theoretical Computer Science
Authors Phan Đình Diệu, Le Cong Thanh, Lê Tuâń Hoa
Institution Institute of Mathematics
Cites: 13
Cited by: 24
Related to: 10
FWCI:
Citation percentile (by year/subfield): 59.31
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed