D. E. Knuth
Abstract
While preparing a book on combinatorial algorithms, I felt a strong need for a new technical term, a word which is essentially a one-sided version of polynomial complete. A great many problems of practical interest have the property that they are at least as difficult to solve in polynomial time as those of the Cook-Karp class KP. I needed an adjective to convey such a degree of difficulty, both formally and informally; and since the range of practical applications is so broad, I felt it would be best to establish such a term as soon as possible.
Recommendations
Reflections on proposal writing and management of a NSF stem scholarship grant program
In recent years, the National Science Foundation (NSF) has established a Scholarship for Science, Technology, Engineering and Mathematics (S-STEM) program to fund universities for providing scholarship to academically talented and financially needy STEM ...
Morpho-syntactic clues for terminological processing in Serbian
MorphSlav '03: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic LanguagesIn this paper we discuss morpho-syntactic clues that can be used to facilitate terminological processing in Serbian. A method (called srCe) for automatic extraction of multiword terms is presented. The approach incorporates a set of generic morpho-...
A proposal for preservice student technology competence
SC '98: Proceedings of the 1998 ACM/IEEE conference on SupercomputingThis panel session will discuss North Carolina's technology requirement for licensure as mandated by the North Carolina State Board of Education.
Comments