搜索页_+Computational+completeness

设为首页

收藏本站

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Readers' Guide

Opening Hours
Collections
Help Via Email

Publications

Electronic Information Resources

常用资源

在“Elsevier电子期刊”中，命中：338条，耗时：0.0160265 秒

在所有数据库中总计命中：1,882条

1.On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability

作者：Igor Konnov ; Helmut Veith ; Josef Widder ; ^{widder@forsyte.at}

关键词：Model checking ; Fault-tolerant distributed algorithms ; Byzantine faults ; Computational models

刊名：Information and Computation

出版年：2017

2.Fully online clustering of evolving data streams into arbitrarily shaped clusters

作者：Richard Hyde ; ^a ; ^{r.hyde1@lancaster.ac.uk}Author Vitae ; Plamen Angelov^aAuthor Vitae ; A.R. MacKenzie^bAuthor Vitae

关键词：Online ; Evolving ; Clustering ; Micro-cluster ; Arbitrary shape

刊名：Information Sciences

出版年：2017

3.Tell me the truth: Practically public authentication for outsourced databases with multi-user modification

作者：Wei Song^a ; ^b ; ^c ; ^{songwei@whu.edu.cn} ; Bing Wang^c ; ^{bingwang@vt.edu} ; Qian Wang ; ^a ; ^{qianwang@whu.edu.cn} ; Zhiyong Peng^a ; ^b ; ^{peng@whu.edu.cn} ; Wenjing Lou^c ; ^vjlou@vt.edu

关键词：Outsourced database ; Public authentication ; Homomorphic verifiable tags

刊名：Information Sciences

出版年：2017

4.Computational complexity of covering three-vertex multigraphs

作者：Jan Kratochví ; l^a ; ¹ ; ^{honza@kam.mff.cuni.cz" class="auth_mail" title="E-mail the corresponding author} ; Jan Arne Telle^b ; ² ; ^{telle@ii.uib.no" class="auth_mail" title="E-mail the corresponding author} ; Marek Tesař^a ; ³ ; ^{tesar@kam.mff.cuni.cz" class="auth_mail" title="E-mail the corresponding author}

关键词：Computational complexity ; Graph homomorphism ; Covering projection

刊名：Theoretical Computer Science

出版年：2016

5.Pull and PushPull are PSPACE-complete

作者：André ; G. Pereira ^{agpereira@inf.ufrgs.br" class="auth_mail" title="E-mail the corresponding author} ; Marcus Ritt ; ^{marcus.ritt@inf.ufrgs.br" class="auth_mail" title="E-mail the corresponding author} ; Luciana S. Buriol ; ^{buriol@inf.ufrgs.br" class="auth_mail" title="E-mail the corresponding author}

关键词：Moving-blocks problems ; PSPACE-completeness ; Sokoban ; Nondeterministic constraint logic

刊名：Theoretical Computer Science

出版年：2016

6.Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results

作者：Julien Herrmann ; ^a ; ^{julien.herrmann@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author} ; George Bosilca^b ; ^{bosilca@icl.utk.edu" class="auth_mail" title="E-mail the corresponding author} ; Thomas Hé ; rault^b ; ^{herault@icl.utk.edu" class="auth_mail" title="E-mail the corresponding author} ; Loris Marchal^a ; ^{loris.marchal@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author} ; Yves Robert^a ; ^b ; ^{yves.robert@ens-lyon.fr" class="auth_mail" title="E-mail the corresponding author} ; Jack Dongarra^b ; ^{dongarra@icl.utk.edu" class="auth_mail" title="E-mail the corresponding author}

关键词：Redistribution ; Linear algebra ; QR factorization ; Stencil ; Data partition ; Parsec

刊名：Parallel Computing

出版年：2016

7.Completeness in PVS of a Nominal Unification Algorithm

作者：Mauricio Ayala-Rincó ; n^a ; ¹ ; ^{ayala@unb.br" class="auth_mail" title="E-mail the corresponding author} ; Maribel Ferná ; ndez^b ; ² ; ^{maribel.fernandez@kcl.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; Ana Cristina Rocha-Oliveira^a ; ³ ; ^{anacrismarie@gmail.com" class="auth_mail" title="E-mail the corresponding author}

关键词：Nominal terms ; binders ; α-equivalence ; nominal unification ; PVS

刊名：Electronic Notes in Theoretical Computer Science

出版年：2016

8.Tractability frontiers of the partner units configuration problem

作者：Erich Christian Teppan^a ; ^{erich.teppan@aau.at" class="auth_mail" title="E-mail the corresponding author} ; Gerhard Friedrich^a ; ^{gerhard.friedrich@aau.at" class="auth_mail" title="E-mail the corresponding author} ; Georg Gottlob^b ; ^{georg.gottlob@cs.ox.ac.uk" class="auth_mail" title="E-mail the corresponding author}

关键词：Partner units problem ; Computational complexity ; NP-completeness

刊名：Journal of Computer and System Sciences

出版年：2016

9.Weak containment for partial words is coNP-complete

作者：Paweł Parys ^{parys@mimuw.edu.pl" class="auth_mail" title="E-mail the corresponding author}

关键词：Computational complexity ; Formal languages ; NP-completeness ; Partial words ; Language containment

刊名：Information Processing Letters

出版年：2016

10.Computing with viruses

作者：Xu Chen^a ; ^{chenxu31@sina.com" class="auth_mail" title="E-mail the corresponding author} ; Mario J. Pé ; rez-Jimé ; nez^b ; ^{marper@us.es" class="auth_mail" title="E-mail the corresponding author} ; Luis Valencia-Cabrera^b ; ^{lvalencia@us.es" class="auth_mail" title="E-mail the corresponding author} ; Beizhan Wang^a ; ^{wangbz@xmu.edu.cn" class="auth_mail" title="E-mail the corresponding author} ; Xiangxiang Zeng^c ; ^{xzeng@xmu.edu.cn" class="auth_mail" title="E-mail the corresponding author}

关键词：Natural computing ; Virus machine ; Register machine ; Turing completeness

刊名：Theoretical Computer Science

出版年：2016

按检索点细分(338)

题名(1)

关键词(56)

文摘(165)

按出版年细分(338)

2027年及以后(12)

2017年(3)

2016年(18)

2015年(6)

2013年(18)

2012年(18)

2011年(28)

2010年(17)

2009年(32)

2008年(24)

2007年(18)

2006年(17)

2005年(19)

2004年(22)

2003年(12)

2002年(12)

2001年(5)

2000年(9)

2000年及以前(48)