1717 search results - page 157 / 344 » A Computable Spectral Theorem |
118
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
120
click to vote
RSA
2006
15 years 4 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
132
click to vote
IPL
2000
15 years 4 months ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
MOC
1998
15 years 4 months ago
1998
This paper (1) gives complete details of an algorithm to compute approximate kth roots; (2) uses this in an algorithm that, given an integer n > 1, either writes n as a perfect ...
116
click to vote
INFORMATICALT
2010
15 years 3 months ago
2010
In the presented paper, some issues of the fundamental classical mechanics theory in the sense of Ising physics are introduced into the applied neural network area. The expansion o...