设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
GSW全文库(2)
CNKI会议论文(9)
CNKI期刊论文0611(2)
Springer电子图书(8)
CNKI学位论文(4549)
知网期刊论文(1939)
在“
SpringerLink电子期刊
”中,
命中:
3,818
条,耗时:0.0189947 秒
在所有数据库中总计命中:
6,509
条
1.
A
polynomial
ly solvable case of the pooling problem
作者:
Natashia Boland
;
Thomas Kalinowski
;
Fabian Rigterink
关键词:
Pooling problem
;
Computational
complexity
;
Polynomial
;
time algorithm
刊名:Journal of Global Optimization
出版年:2017
2.
On the annihilator ideal of an inverse form
作者:
Graham H. Norton
关键词:
Annihilator ideal
;
Berlekamp–Massey algorithm
;
Grlex monomial order
;
Gröbner basis
;
Linear
complexity
;
Minimal
polynomial
;
Inverse form
;
S
polynomial
;
Syzygy
刊名:Applicable Algebra in Engineering, Communication and Computing
出版年:2017
3.
A solution to a conjecture on the generalized connectivity of graphs
作者:
Lily Chen
;
Xueliang Li
;
Mengmeng Liu
;
Yaping Mao
关键词:
Generalized connectivity
;
Generalized edge
;
connectivity
;
Complexity
;
Polynomial
;
time algorithm
;
\(\mathcal {N}\mathcal {P}\)
;
complete
刊名:Journal of Combinatorial Optimization
出版年:2017
4.
On Cones of Nonnegative Quartic Forms
作者:
Bo Jiang
;
Zhening Li
;
Shuzhong Zhang
关键词:
Cone of
polynomial
functions
;
Super
;
symmetric tensors
;
Nonnegative quartic forms
;
Sums of squares
;
SOS
;
convexity
;
Polynomial
optimization
刊名:Foundations of Computational Mathematics
出版年:2017
5.
Knapsack problem with objective value gaps
作者:
Alexander Dolgui
;
Mikhail Y. Kovalyov
;
Alain Quilliot
关键词:
Knapsack problem
;
Computational
complexity
;
Fully
polynomial
time approximation scheme
;
Forbidden values
刊名:Optimization Letters
出版年:2017
6.
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
作者:
Ximei Yang
;
Hongwei Liu
;
Yinkui Zhang
关键词:
Euclidean Jordan algebra
;
Symmetric optimization
;
Arc
;
search
;
Infeasible
;
interior
;
point method
;
Polynomial
complexity
刊名:Optimization Letters
出版年:2017
7.
The recoverable robust spanning tree problem with interval costs is
polynomial
ly solvable
作者:
Mikita Hradovich
;
Adam Kasperski
;
Paweł Zieliński
关键词:
Robust optimization
;
Interval data
;
Spanning tree
;
Matroids
刊名:Optimization Letters
出版年:2017
8.
Row reduction applied to decoding of rank-metric and subspace codes
作者:
Sven Puchinger
;
Johan Rosenkilde né Nielsen
;
Wenhui Li…
关键词:
Skew
polynomial
s
;
Row reduction
;
Module minimisation
;
Gabidulin codes
;
Shift register synthesis
;
Mahdavifar–Vardy codes
刊名:Designs, Codes and Cryptography
出版年:2017
9.
An infeasible full-NT step interior point algorithm for CQSCO
作者:
Behrouz Kheirfam
关键词:
Convex quadratic symmetric cone optimization
;
Interior
;
point method
;
Infeasible method
;
Euclidean Jordan algebra
;
Polynomial
complexity
刊名:Numerical Algorithms
出版年:2017
10.
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals
作者:
Marcus Schaefer
;
Daniel Štefankovič
关键词:
Fixed point problems
;
Brouwer
;
Existential theory of the real numbers
;
Nash equilibrium
;
Computational
complexity
刊名:Theory of Computing Systems
出版年:2017
1
2
3
4
5
6
7
8
9
按检索点细分(3818)
题名(77)
关键词(250)
文摘(3052)
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
.