ALL ASU ECSU ECU FSU NCCU UNCA UNCC UNCG UNCP UNCW WCU       

 

Browse All

• Titles
• Author By Last Name
• Keywords
• Departments

Theses & Dissertations

• Titles
• Author By Last Name
• Advisor By Last Name
• Keywords
• Type
• Degrees By Discipline

Submissions

• Faculty Submissions
• Student Submissions
• Research Data

Browse by Keywords - N

Select the first letter of the keywords to browse

• OTHER
• #
• -
• .
• 1
• 2
• 3
• 4
• 5
• 7
• 9
• A
• B
• C
• D
• E
• É
• F
• G
• H
• I
• J
• K
• L
• M
• N
• O
• P
• Q
• R
• S
• ß
• T
• U
• V
• W
• X
• Y
• Z

There are 2 record/s using the keyword/s: np-hard problems.

Title	Date	Creator	Publication Type	Institution
Number of Holes in Unavoidable Sets of Partial Words II	2012	Blanchet-Sadri, Francine	Faculty	Computer Science, UNCG
Testing avoidability on sets of partial words is hard	2009	Blanchet-Sadri, Francine	Faculty	Computer Science, UNCG

• Help
• About Us

Maintained by ERIT, University Libraries, UNCG