Weak Completeness in E and E_2
نویسندگان
چکیده
The notions of weak m completeness for the complexity classes E DTIME linear and E DTIME polynomial are compared An element C of one of these classes is weakly m complete for the class if the set Pm C consisting of all languages A m C does not have measure in the class The following two results are proven i Every problem that is weakly m complete for E is weakly P m complete for E ii There is a problem in E that is weakly m complete for E but not for E
منابع مشابه
B -AND B - COMPLETENESS IN LOCALLY CONVEX ALGEBRAS AND THE E x THEOREM
Let E be a B-complete (B -complete) locally convex algebra and $ the topological direct sum of countably many copies of the scalar field with a jointly continuous algebra multiplication. It has been shown that E is also B-complete (B -complete) for componentwise multiplication on E . B-and Br-completeness of E , the unitization of E, and also of E x for other multiplications on E ...
متن کاملSOME RESULTS ON INTUITIONISTIC FUZZY SPACES
In this paper we define intuitionistic fuzzy metric and normedspaces. We first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. In section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. Finally,we consider some properties of...
متن کاملA Comparison of Weak Completeness Notions 1 Extended
We compare the weak completeness notions for E in the sense of Lutz's resource-bounded measure theory 11] with respect to the standard polynomial time reducibilities. Our results parallel results for classical completeness by Watanabe 17] and others. We show that the weak completeness notions for 1-query reductions coincide: A set is weakly complete for E under 1-truth-table reducibility ii it ...
متن کاملE ectiveness of the Completeness Theorem for an Intermediate Logic 1
We investigate e ectiveness of the completeness result for the logic with the Weak Law of Excluded Middle.
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 143 شماره
صفحات -
تاریخ انتشار 1995