1717 search results - page 156 / 344 » A Computable Spectral Theorem |
122
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
119
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
127
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
139
click to vote
ERSHOV
1989
Springer
15 years 8 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
143
click to vote
AISC
2004
Springer
15 years 8 months ago
2004
Springer
We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Her...