1717 search results - page 94 / 344 » A Computable Spectral Theorem |
141
click to vote
CADE
2007
Springer
15 years 10 months ago
2007
Springer
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
153
click to vote
JSYML
2007
15 years 4 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
162
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
131
click to vote
APPML
2007
15 years 4 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
149
click to vote
ISVC
2010
Springer
15 years 2 months ago
2010
Springer
Physically-based image synthesis requires measured spectral quantities for illuminants and reflectances as part of the virtual scene description to compute trustworthy lighting si...