SIGN IN
SIGN UP
On the complexity of unique solutions
Full Text:
PDF
Buy this Article
Author:
Christos H. Papadimitriou
Department of Computer Science, Stanford University, Stanford, CA
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 31 Issue 2, April 1984
Pages 392-400
ACM
New York, NY
, USA
table of contents
doi>
10.1145/62.322435
1984 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 34
· Downloads (cumulative): 655
· Citation Count: 18
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
complexity of proof procedures
performance
sequencing and scheduling
theory
verification
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