journal article
Nov 01, 2001
Which bases admit non-trivial shrinkage of formulae?
Topics
No keywords indexed for this article. Browse by subject →
Metrics
7
Citations
0
References
Details
- Published
- Nov 01, 2001
- Vol/Issue
- 10(1)
- Pages
- 28-40
- License
- View
Authors
Cite This Article
H. Chockler, U. Zwick (2001). Which bases admit non-trivial shrinkage of formulae?. Computational Complexity, 10(1), 28-40. https://doi.org/10.1007/pl00001610
Related
You May Also Like
Amplifying circuit lower bounds against polynomial time, with applications
Richard J. Lipton, Ryan Williams · 2013
10 citations