University of Colorado, Boulder
CU Scholar
Computer Science Technical Reports
Computer Science
Fall 10-1-1993
The Learnability of Optimality Theory: An
Algorithm and Some Basic Complexity Results ;
CU-CS-678-93
Bruce Tesar
University of Colorado Boulder
Paul Smolensky
University of Colorado Boulder
Follow this and additional works at: http://scholar.colorado.edu/csci_techreports
Recommended Citation
Tesar, Bruce and Smolensky, Paul, "The Learnability of Optimality Theory: An Algorithm and Some Basic Complexity Results ; CUCS-678-93" (1993). Computer Science Technical Reports. 649.
http://scholar.colorado.edu/csci_techreports/649
This Technical Report is brought to you for free and open access by Computer Science at CU Scholar. It has been accepted for inclusion in Computer
Science Technical Reports by an authorized administrator of CU Scholar. For more information, please contact [email protected].