2446 search results - page 159 / 490 » Choiceless Polynomial Time |
86
Voted
RP
2010
Springer
14 years 11 months ago
2010
Springer
Chrobak (1986) proved that a language accepted by a given nondeterministic finite automaton with one-letter alphabet, i.e., a unary NFA, with n states can be represented as the uni...
109
Voted
CISSE
2009
Springer
14 years 11 months ago
2009
Springer
In Component-based Software (CBS) development, it is desirable to choose software components that provide all necessary functionalities and at the same time optimize certain nonfun...
109
Voted
CORR
2012
Springer
13 years 8 months ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
106
Voted
RECOMB
1997
Springer
15 years 5 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...
89
Voted
FOCS
1994
IEEE
15 years 5 months ago
1994
IEEE
We consrder asynchronous general topology dynamic networks of identical nameless nodes wzth worst-case transient faults. Starting from any faulty configuration, our protocols self...