Author： Sander
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.246, Iss.1, 2000-09, pp. : 195-225
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
The rectangle complexity of functions on two-dimensional lattices
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Access to resources
Recommend
Computational complexity of functions
By Levin L.A.
Theoretical Computer Science, Vol. 157, Iss. 2, 1996-05 ,pp. :
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
By Cai J.-Y.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Uniform computational complexity of the derivatives of C ~ -functions
By Blaser M.
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :