全部文献期刊会议图书|学者科研项目
中外文文献  中文文献  外文文献
作者:Hubie Chen , Moritz Müller
来源:[J].Theory of Computing Systems(IF 0.477), 2017, Vol.61 (3), pp.851-870Springer
摘要:... We study this problem using an established perspective in parameterized complexity theory: the universe size of the first structure is taken to be the parameter, and we define the embedding problem relative to a class \({\mathcal {A}}\) of structures to be the restricted vers...
作者:Yong-Jin Liu , Dian Fan , Chunxu Xu ...
来源:[J].Information Processing Letters(IF 0.488), 2017, Vol.124, pp.10-14Elsevier
摘要:... For an arbitrary triangle mesh with n vertices, these algorithms have space complexity of O ( n 2 ) . In this paper, we prove that both algorithms have Θ ( n 1.5 ) space complexity on a completely regular triangulation (i.e., all triangles are equilateral).
作者:Claire Capdevielle , Colette Johnen , Petr Kuznetsov ...
来源:[J].Distributed Computing(IF 0.627), 2017, Vol.30 (6), pp.459-468Springer
摘要:In this paper, we study uncontended complexity of anonymous k -set agreement algorithms, counting the number of memory locations used and the number of memory updates performed in operations that encounter no contention. We assume that in contention-free executions of a k -se...
作者:Rati Gelashvili
来源:[J].Distributed Computing(IF 0.627), 2018, Vol.31 (4), pp.317-326Springer
摘要:Abstract(#br)The optimal space complexity of consensus in asynchronous shared memory was an open problem for two decades. For a system of n processes, no algorithm using a sublinear number of registers is known. Up until very recently, the best known lower bound due to Fich, ...
作者:Qi Wang , Xiubin Fan , Hongyan Zang ...
来源:[J].Theoretical Computer Science(IF 0.489), 2016, Vol.630, pp.76-94Elsevier
摘要:... Then we gain the space complexity of sieving and building equations over the ring Z / 2 Z .
作者:Vidhya Ramaswamy , Jayalal Sarma , K.S. Sunil
来源:[J].Journal of Computer and System Sciences(IF 1), 2019, Vol.105, pp.40-53Elsevier
摘要:... On the complexity frontier of this problem, we show the following results. • When A is a group whose size is polynomially bounded in the size of the graph (hence equivalently presented as a multiplication table at the input), and the graph is undirected, the A - Reach pro...
作者:Andrzej Szepietowski
来源:[J].Information Processing Letters(IF 0.488), 1998, Vol.68 (6), pp.299-302Elsevier
摘要:Abstract(#br)In this paper we show that for any function between logarithm and the linear functions, weak and strong one-way space complexity classes are not equivalent. Thus, unlike for two-way Turing machines, for one-way Turing machines there is no “well behaved” func...
作者:Oded Lachish , Ilan Newman , Asaf Shapira
来源:[J].computational complexity(IF 0.325), 2008, Vol.17 (1), pp.70-93Springer
摘要:... In this paper we study the relation between the space complexity of a language and its query complexity. Our main result is that for any space complexity s ( n ) ≤ log n there is a language with space complexity O ( s ( n )) and query complexity 2 Ω( s ( n )) .(#br)Our ...
作者:K. Cullik , N. D. Diamond
来源:[J].International Journal of Computer Mathematics(IF 0.542), 1980, Vol.8 (3), pp.207-222Taylor & Francis
摘要:... Here we show that by restrictions on the erasing h0 we obtain most time-complexity language classes, and by restrictions on the pair (h1h2) we characterize all space complexity language classes.
作者:Etsuro Moriya , Takemaru Tada
来源:[J].International Journal of Computer Mathematics(IF 0.542), 2003, Vol.80 (3), pp.295-304Taylor & Francis
摘要:... In this paper the following inclusions that express the space complexity of turn bounded pushdown automata are given: \hbox{DPDA-TURN}(\,f(n)) \subseteq {\bf DSPACE}(\log f(n)\log n) , and \hbox{NPDA-TURN}(\,f(n)) \subseteq {\bf NSPACE} (\log f(n)\log n) . In particular, it f...

我们正在为您处理中,这可能需要一些时间,请稍等。

资源合作:cnki.scholar@cnki.net, +86-10-82896619   意见反馈:scholar@cnki.net

×