16666 search results - page 277 / 3334 » Descriptive and Computational Complexity |
180
click to vote
DLT
2009
15 years 4 months ago
2009
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
132
click to vote
BIRTHDAY
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
153
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
We study the shrinking and separation properties (two notions well-known in descriptive set theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions...
175
click to vote
DLOG
2003
15 years 8 months ago
2003
We propose a method to compare semantically two natural language texts. The process is realized in two steps, the first translates the texts into description logics terminologies...
166
click to vote
JGTOOLS
2006
15 years 6 months ago
2006
Spherical harmonic transform plays an important role in research in shape description. Current computation methods involve expensive voxelization, and are prone to numerical error...