Fast solution of some random NP-hard problems

Author

Dyer, M.E. ; Frieze, A.M.

fYear

1986

fDate

27-29 Oct. 1986

Firstpage

331

Lastpage

336

Keywords

Computational complexity; Concrete; Educational institutions; NP-hard problem; Partitioning algorithms; Polynomials; Random variables;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 1986., 27th Annual Symposium on

Conference_Location

Toronto, ON, Canada

ISSN

0272-5428

Print_ISBN

0-8186-0740-8

Type

DOI

10.1109/SFCS.1986.17

Filename

4568224

Link To Document