| other,26-2-P99-1038,ak | polynomial time test </term> for the <term> | availability of a reading | </term> , while solving the same problem | #30898 We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deterministic, polynomial time test for the availability of a reading , while solving the same problem within theories based on the well-formedness of sentences in the meaning language has been shown to be NP-hard. |
