534 search results - page 10 / 107 » Efficient polynomial L-approximations |
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
DIS
2007
Springer
13 years 11 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
For a given finite set of matrices with nonnegative integer entries we study the growth with t of max{ A1
SIAMJO
2000
13 years 7 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...