arXiv2
Search
Dark
/ Date
/ Name
/ Date
/ Name
Aa
W
cs.CC
cs.CC
/ Date
/ Name
/ Date
/ Name
cs.CC — arXiv2
Showing 61–66 of 66 results
/ Date
/ Name
Dec 10, 2010
Multivariate Polynomial Integration and Derivative Are Polynomial Time Inapproximable unless P=NP
Sep 23, 2010
On Polynomial Multiplication in Chebyshev Basis
Jul 15, 2010
The Complexity of Testing Monomials in Multivariate Polynomials
Jul 7, 2010
A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing
Nov 30, 2005
Phase transition in the assignment problem for random matrices
May 6, 2002
The asymptotic complexity of partial sorting -- How to learn large posets by pairwise comparisons
← Previous