SIGN IN
SIGN UP
Dynamic parallel complexity of computational circuits
Full Text:
PDF
Buy this Article
Authors:
G. Miller
Department of Computer Science, University of Southern California, Los Angeles, California
S. Teng
Department of Computer Science, University of Southern California, Los Angeles, California
Published in:
· Proceeding
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Pages 254-263
ACM
New York, NY
, USA
©1987
table of contents
ISBN:0-89791-221-7
doi>
10.1145/28395.28423
1987 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Downloads (cumulative): 147
· Citation Count: 5
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:
algorithms
parallelism and concurrency
path and circuit problems
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