SIGN IN
SIGN UP
Word problems requiring exponential time(Preliminary Report)
Full Text:
PDF
Buy this Article
Authors:
L. J. Stockmeyer
A. R. Meyer
Published in:
· Proceeding
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Pages 1-9
ACM
New York, NY
, USA
©1973
table of contents
doi>
10.1145/800125.804029
1973 Article
Bibliometrics
· Downloads (6 Weeks): 16
· Downloads (12 Months): 112
· Downloads (cumulative): 1,412
· Citation Count: 230
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
classes defined by grammars or automata
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder