SIGN IN
SIGN UP
Deterministic restrictions in circuit complexity
Full Text:
PDF
Buy this Article
Authors:
Shiva Chaudhuri
Max-Planck Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany
Jaikumar Radhakrishnan
Tata Institute of Fundamental Research, Bombay, India
Published in:
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 30-36
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-785-5
doi>
10.1145/237814.237824
1996 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 16
· Downloads (cumulative): 256
· Citation Count: 14
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:
complexity measures and classes
switching theory
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