2446 search results - page 142 / 490 » Choiceless Polynomial Time |
122
click to vote
QSIC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...
124
click to vote
GI
2007
Springer
15 years 10 months ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...
149
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
125
click to vote
SAT
2005
Springer
15 years 9 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
146
click to vote
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...