Skip to main content
Log in
Menu
Find a journal
Publish with us
Track your research
Search
Cart
Home
computational complexity
Volumes and issues
Volume 10, Issue 1
computational complexity
Publishing model
:
Hybrid
Submit your manuscript
(this opens in a new tab)
Back to Overview
Editorial board
Aims and scope
Journal updates
Search all computational complexity articles
Volume 10, Issue 1
November 2001
4 articles in this issue
Depth-3 arithmetic circuits over fields of characteristic zero
A. Shpilka
A. Wigderson
Pages: 1 - 27
Which bases admit non-trivial shrinkage of formulae?
H. Chockler
U. Zwick
Pages: 28 - 40
Fast computation of the Smith form of a sparse integer matrix
M. Giesbrecht
Pages: 41 - 69
The “log rank” conjecture for modular communication complexity
C. Meinel
S. Waack
Pages: 70 - 91
Search
Search by keyword or author
Search
Navigation
Find a journal
Publish with us
Track your research