Author of the publication

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.

, , , and . Discrete Applied Mathematics, 120 (1-3): 13-23 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Morgana, Aurora
add a person with the name Morgana, Aurora
 

Other publications of authors with the same name