828 search results - page 43 / 166 » Bounded Hairpin Completion |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
SRDS
2000
IEEE
14 years 18 hour ago
2000
IEEE
This paper discusses the implementation and performance of bounded voting: a new object replication protocol designed for use in mobile and weakly-connected environments. We show ...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...