Back to Results
First PageMeta Content
Applied mathematics / NP-complete / Optimality theory / NP-hard / NP / Hamiltonian path problem / Complete / Strongly NP-complete / Co-NP / Theoretical computer science / Computational complexity theory / Complexity classes


Document Date: 2009-08-01 00:43:08

Open Document

File Size: 76,11 KB

Share Result on Facebook

City

Malden / New York / /

Company

Cambridge University Press / MIT Press / Russell / /

/

Facility

Marie Mount Hall University of Maryland College Park / Massachusetts Institute of Technology / /

IndustryTerm

polynomial-time algorithms / rule-based derivational systems / polynomialtime algorithms / /

Organization

NP / Cambridge University / Department of Linguistics / Massachusetts Institute of Technology / University of Maryland College Park / Association for Computational Linguistics / /

Person

Alan / William J. Idsardi Adapting / Fred Mailhot / David S. Johnson / Prince / Charles Reiss / G. Edward / Jr. / Optimality Theory / Eric S. Ristad / Paul Smolensky / Garey / Lauri Karttunen / Robert C. Berwick / Barton / Jason Eisner / /

/

Position

author / Prince / candidate for present purposes / /

ProvinceOrState

Maryland / Massachusetts / /

PublishedMedium

Computational Linguistics / Linguistic Inquiry / /

Technology

polynomial-time algorithms / polynomialtime algorithms / /

SocialTag