10 search results - page 2 / 2 » icalp 1995 |
104
Voted
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
123
Voted
ICALP
1995
Springer
15 years 5 months ago
1995
Springer
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) w...
108
Voted
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
134
Voted
SIAMCOMP
1998
15 years 1 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
189
Voted
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...