1717 search results - page 169 / 344 » A Computable Spectral Theorem |
145
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
188
click to vote
IPSN
2010
Springer
15 years 8 months ago
2010
Springer
In-network processing is recommended for many sensor network applications to reduce communication and improve energy efficiency. However, constraints on memory, speed, and energy ...
160
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
144
click to vote
ISMVL
1994
IEEE
15 years 10 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
193
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
This note reexamines Spector's remarkable computational interpretation of full classical analysis. Spector's interpretation makes use of a rather abstruse recursion schem...