Cited By
View all- Denenberg LLewis H(2006)Logical syntax and computational complexityComputation and Proof Theory10.1007/BFb0099481(101-115)Online publication date: 15-Nov-2006
- ADACHI AKASAI T(1987)Are problems having a polynomial time upper bound actually thought to be feasible?Discrete Algorithms and Complexity10.1016/B978-0-12-386870-1.50023-X(311-324)Online publication date: 1987