1379 search results - page 143 / 276 » The Complexity of the Annihilating Polynomial |
171
click to vote
DLOG
2006
15 years 7 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
131
click to vote
ACL
2001
15 years 7 months ago
2001
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
159
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
138
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
192
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...