Sciweavers

2446 search results - page 47 / 490
» Where am I
Sort
View
STOC
2004
ACM
109views Algorithms» more  STOC 2004»
14 years 10 months ago
Approximating the cut-norm via Grothendieck's inequality
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
Noga Alon, Assaf Naor
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 3 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
FOCS
1991
IEEE
14 years 1 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer
DM
2008
90views more  DM 2008»
13 years 10 months ago
On sums of binomial coefficients and their applications
In this paper we study recurrences concerning the combinatorial sum n r m = kr (mod m) n k and the alternate sum kr (mod m)(-1)(k-r)/m n k , where m > 0, n 0 and r are integers....
Zhi-Wei Sun
AI
2008
Springer
13 years 10 months ago
The well-designed young mathematician
This paper complements McCarthy's "The well designed child", in part by putting it in a broader context, the space of possible well designed progeny, and in part by...
Aaron Sloman