设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(32)
馆藏书目(6)
院士团队服务(1)
CNKI会议论文(22)
CNKI期刊论文0611(32)
中国地质文献-英文(6)
Springer电子图书(59)
万方学术会议(2)
CNKI学位论文(19815)
知网期刊论文(11789)
在“
Elsevier电子期刊
”中,
命中:
8,474
条,耗时:0.0419782 秒
在所有数据库中总计命中:
31,764
条
1.
Position model
computational
complexity
of walking robot with different parallel leg mechanism topology patterns
作者:
Yang Pan
;
py0330@gmail.com
;
Feng Gao
fengg@sjtu.edu.cn
关键词:
Walking robots
;
Position model
;
Computational
complexity
刊名:Mechanism and Machine Theory
出版年:2017
2.
Strong partial clones and the time
complexity
of SAT problems
作者:
Peter Jonsson
a
;
peter.jonsson@liu.se" class="auth_mail" title="E-mail the corresponding author
;
Victor Lagerkvist
b
;
victor.lagerqvist@tu-dresden.de" class="auth_mail" title="E-mail the corresponding author
;
Gustav Nordh
c
;
gustav.nordh@gmail.com" class="auth_mail" title="E-mail the corresponding author
;
Bruno Zanuttini
d
;
bruno.zanuttini@unicaen.fr" class="auth_mail" title="E-mail the corresponding author
关键词:
Satisfiability problems
;
Computational
complexity
;
Clone theory
;
Universal algebra
;
Subexponential time
刊名:Journal of Computer and System Sciences
出版年:2017
3.
On the arithmetic
complexity
of Strassen-like matrix multiplications
作者:
Murat Cenk
a
;
mcenk@metu.edu.tr
;
M. Anwar Hasan
b
;
ahasan@uwaterloo.ca
关键词:
Fast matrix multiplication
;
Strassen-like matrix multiplication
;
Computational
complexity
;
Cryptographic computations
;
Computer algebra
刊名:Journal of Symbolic Computation
出版年:2017
4.
Complexity
of rainbow vertex connectivity problems for restricted graph classes
作者:
Juho Lauri
juho.lauri@tut.fi
关键词:
Rainbow connectivity
;
Computational
complexity
刊名:Discrete Applied Mathematics
出版年:2017
5.
Computational
complexity
reduction in nonuniform compressed sensing by multi-coset emulation
作者:
Ruben Grigoryan
;
ruben.grigoryan@fysik.dtu.dk" class="auth_mail" title="E-mail the corresponding author
;
Tobias Lindstrø
;
m Jensen
tlj@es.aau.dk" class="auth_mail" title="E-mail the corresponding author
;
Torben Larsen
tl@es.aau.dk" class="auth_mail" title="E-mail the corresponding author
关键词:
SNS
;
single-channel sonuniform sampling
;
MCS
;
multi-coset sampling
;
SRR
;
support reconstruction ratio
刊名:Signal Processing
出版年:2017
6.
Separating sets of strings by finding matching patterns is almost always hard
作者:
Giuseppe Lancia
a
;
Luke Mathieson
b
;
luke.mathieson@newcastle.edu.au
;
Pablo Moscato
b
关键词:
Pattern identification
;
Parameterized
complexity
;
Computational
complexity
刊名:Theoretical Computer Science
出版年:2017
7.
On the
complexity
of computing the k-restricted edge-connectivity of a graph
作者:
Luis Pedro Montejano
a
;
lpmontejano@gmail.com
;
Ignasi Sau
b
;
ignasi.sau@lirmm.fr
关键词:
Graph cut
;
k-Restricted edge-connectivity
;
Good edge separation
;
Parameterized
complexity
;
FPT-algorithm
;
Polynomial kernel
刊名:Theoretical Computer Science
出版年:2017
8.
How people learn while playing serious games: A
computational
modelling approach
作者:
Wim Westera
wim.westera@ou.nl
Author Vitae
关键词:
Serious gaming
;
Learning
;
Simulation
;
Modelling
;
Flow theory
;
Methodology
刊名:Journal of
Computational
Science
出版年:2017
9.
On the algorithmic
complexity
of adjacent vertex closed distinguishing colorings number of graphs
作者:
Ali Dehghan
a
;
alidehghan@sce.carleton.ca
;
Mohsen Mollahajiaghaei
b
;
mmollaha@uwo.ca
关键词:
Closed distinguishing labeling
;
List closed distinguishing labeling
;
Strong closed distinguishing labeling
;
Computational
complexity
;
Combinatorial Nullstellensatz
刊名:Discrete Applied Mathematics
出版年:2017
10.
Two
complexity
results for the vertex coloring problem
作者:
D.S. Malyshev
a
;
dsmalyshev@rambler.ru
;
O.O. Lobanova
b
;
olga-olegov@yandex.ru
关键词:
Computational
complexity
;
Coloring problem
;
Hereditary class
;
Polynomial-time algorithm
刊名:Discrete Applied Mathematics
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(8474)
题名(222)
关键词(1578)
文摘(6301)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.