咨询与建议

限定检索结果

文献类型

  • 385 篇 期刊文献
  • 27 篇 会议
  • 4 篇 学位论文

馆藏范围

  • 416 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 299 篇 理学
    • 294 篇 数学
    • 12 篇 统计学(可授理学、...
    • 2 篇 化学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 1 篇 物理学
  • 184 篇 工学
    • 124 篇 计算机科学与技术...
    • 44 篇 软件工程
    • 27 篇 控制科学与工程
    • 18 篇 电气工程
    • 14 篇 机械工程
    • 8 篇 信息与通信工程
    • 5 篇 仪器科学与技术
    • 3 篇 动力工程及工程热...
    • 3 篇 电子科学与技术(可...
    • 3 篇 石油与天然气工程
    • 2 篇 化学工程与技术
    • 1 篇 土木工程
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物工程
  • 151 篇 管理学
    • 148 篇 管理科学与工程(可...
    • 16 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 16 篇 经济学
    • 13 篇 应用经济学
    • 3 篇 理论经济学
  • 7 篇 教育学
    • 7 篇 心理学(可授教育学...
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 农学
  • 1 篇 军事学

主题

  • 416 篇 polynomial algor...
  • 37 篇 complexity
  • 27 篇 scheduling
  • 17 篇 np-completeness
  • 15 篇 linear programmi...
  • 13 篇 dynamic programm...
  • 12 篇 np-complete
  • 11 篇 computational co...
  • 11 篇 combinatorial op...
  • 10 篇 stable set
  • 10 篇 kernel function
  • 9 篇 np-hardness
  • 8 篇 graph
  • 8 篇 matching
  • 7 篇 graphs
  • 7 篇 tree
  • 6 篇 longest path pro...
  • 6 篇 interior-point m...
  • 6 篇 independent set
  • 6 篇 hamiltonian cycl...

机构

  • 9 篇 univ southern de...
  • 8 篇 rutgers state un...
  • 8 篇 pusan natl univ ...
  • 6 篇 dongseo univ dep...
  • 5 篇 univ so denmark ...
  • 5 篇 univ southern de...
  • 5 篇 univ toronto div...
  • 5 篇 univ nizhny novg...
  • 4 篇 univ paris 09 la...
  • 4 篇 inst engn cybern...
  • 4 篇 kyoto univ grad ...
  • 4 篇 univ johannesbur...
  • 4 篇 belarusian state...
  • 4 篇 univ ioannina de...
  • 3 篇 beijing inst tec...
  • 3 篇 odense univ dept...
  • 3 篇 moscow mv lomono...
  • 3 篇 lomonosov moscow...
  • 3 篇 univ primorska u...
  • 3 篇 eotvos lorand un...

作者

  • 13 篇 lozin vv
  • 11 篇 bang-jensen jorg...
  • 9 篇 nagamochi h
  • 8 篇 mertzios george ...
  • 8 篇 cho gyeong-mi
  • 7 篇 ibaraki t
  • 7 篇 hansen p
  • 6 篇 averbakh igor
  • 6 篇 jaumard b
  • 6 篇 bang-jensen j.
  • 6 篇 bang-jensen j
  • 6 篇 gerber mu
  • 5 篇 hertz a
  • 5 篇 averbakh i
  • 5 篇 levner eugene
  • 5 篇 yeo anders
  • 5 篇 woeginger gj
  • 4 篇 tao yuegang
  • 4 篇 tuza z
  • 4 篇 chu chengbin

语言

  • 336 篇 英文
  • 77 篇 其他
  • 3 篇 中文
  • 1 篇 德文
  • 1 篇 法文
检索条件"主题词=Polynomial algorithm"
416 条 记 录,以下是281-290 订阅
排序:
Deciding multiaffinity of polynomials over a finite field
收藏 引用
DISCRETE MATHEMATICS AND APPLICATIONS 2024年 第4期34卷 233-244页
作者: Selezneva, Svetlana N. Lomonosov Moscow State Univ Moscow Russia
We consider polynomials f(x1, & mldr;, xn) over a finite filed that satisfy the following condition: the set of solutions of the equation f(x1, & mldr;, xn) = b, where b is some element of the field, coincides... 详细信息
来源: 评论
Identities of the Kauffman monoid K3
收藏 引用
COMMUNICATIONS IN ALGEBRA 2020年 第5期48卷 1956-1968页
作者: Chen, Yuzhu Hu, Xun Kitov, Nikita, V Luo, Yanfeng Volkov, Mikhail V. Lanzhou Univ Dept Math & Stat Lanzhou Gansu Peoples R China Chongqing Technol & Business Univ Dept Math & Stat Chongqing Peoples R China Ural Fed Univ Inst Nat Sci & Math Lenina 51 Ekaterinburg 620000 Russia
We give a transparent combinatorial characterization of the identities satisfied by the Kauffman monoid Our characterization leads to a polynomial time algorithm to check whether a given identity holds in K-3.
来源: 评论
A METHOD FOR MODELING THE STRUCTURE OF INITIAL DATA AND SUBCLASSES OF SOLVABLE COMBINATORIAL OPTIMIZATION PROBLEMS
收藏 引用
CYBERNETICS AND SYSTEMS ANALYSIS 2014年 第1期50卷 1-7页
作者: Donets, G. A. Sergienko, I. V. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine
A class of polynomially solvable problems of combinatorial optimization is illustrated by the example of the traveling salesman problem. It is proved that this class includes problems for which the structure of initia... 详细信息
来源: 评论
GENERAL APPROACH TO ESTIMATING THE COMPLEXITY OF POSTOPTIMALITY ANALYSIS FOR DISCRETE OPTIMIZATION PROBLEMS
收藏 引用
CYBERNETICS AND SYSTEMS ANALYSIS 2010年 第2期46卷 290-295页
作者: Mikhailyuk, V. A. Natl Acad Sci Ukraine VM Glushkov Cybernet Inst Kiev Ukraine
It is shown that there does not exist a polynomial algorithm to derive the optimal solution of a set cover problem that differs from the original problem in one position of the constraint matrix if the optimal solutio... 详细信息
来源: 评论
Finding blocks and other patterns in a random coloring of Z
收藏 引用
RANDOM STRUCTURES & algorithmS 2006年 第1期28卷 37-75页
作者: Matzinger, H Rolles, SWW Georgia Inst Technol Sch Math Atlanta GA 30332 USA Univ Bielefeld Dept Math D-33501 Bielefeld Germany
Let xi := (xi(k))(k is an element of Z) be i.i.d. with P(xi(k) = 0) = P(xi(k) = 1) = 1/2, and let S := (S-k)(k is an element of N0) be a symmetric random walk with holding on Z, independent of. We consider the scenery... 详细信息
来源: 评论
On the jump number problem in hereditary classes of bipartite graphs
收藏 引用
ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS 2000年 第4期17卷 377-385页
作者: Lozin, VV Gerber, MU Nizhny Novgorod Univ Nizhnii Novgorod 603600 Russia Swiss Fed Inst Technol Dept Math CH-1015 Lausanne Switzerland
We prove a necessary condition for polynomial solvability of the jump number problem in classes of bipartite graphs characterized by a finite set of forbidden induced bipartite subgraphs. For some classes satisfying t... 详细信息
来源: 评论
The vehicle routing problem with pickups and deliveries on some special graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2002年 第3期116卷 193-229页
作者: Tzoreff, TE Granot, D Granot, F Sosic, G Univ British Columbia Fac Commerce & Business Adm Vancouver BC V6T 1Z2 Canada
The vehicle routing with pickups and deliveries (VRPD) problem is defined over a graph G=(V,E). Some vertices in G represent delivery customers who expect deliveries from a depot, and other vertices in G represent pic... 详细信息
来源: 评论
On a generalized single machine scheduling problem with time-dependent processing times
收藏 引用
IFAC-PapersOnLine 2016年 第12期49卷 226-230页
作者: Lazarev, Alexander A. Arkhipov, Dmitry I. Werner, Frank V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences International Laboratory of Decision Choice and Analysis National Research University Higher School of Economics Lomonosov Moscow State University Moscow Institute of Physics and Technology Moscow Dolgoprudny Russia V.A. Trapeznikov Institute of Control Sciences of Russian Academy of Sciences Moscow Russia Faculty of Mathematics Institute of Mathematical Optimization Otto-von-Guericke University Magdeburg Germany
In this paper, a generalized formulation of a classical single machine scheduling problem is considered. A set of n jobs characterized by their release dates, deadlines and a start time-dependent processing time funct... 详细信息
来源: 评论
Computing remoteness functions of Moore, Wythoff, and Euclid's games
收藏 引用
INTERNATIONAL JOURNAL OF GAME THEORY 2024年 第4期53卷 1315-1333页
作者: Boros, Endre Gurvich, Vladimir Makino, Kazuhisa Vyalyi, Michael Rutgers State Univ Business Sch MSIS & RUTCOR 100 Rockafellar Rd Piscataway NJ 08854 USA Kyoto Univ Res Inst Math Sci Kyoto Japan Natl Res Univ Higher Sch Econ HSE Moscow Russia Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow Russia Moscow Inst Phys & Technol Dept Control & Appl Math Dolgoprudnyi Russia
We study remoteness function R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlengt... 详细信息
来源: 评论
Gray codes with bounded weights
收藏 引用
DISCRETE MATHEMATICS 2012年 第17期312卷 2599-2611页
作者: Dvorak, Tomas Fink, Jiri Gregor, Petr Koubek, Vaclav Charles Univ Prague Fac Math & Phys Prague 11800 Czech Republic
Given a set H of binary vectors of length n, is there a cyclic listing of H so that every two successive vectors differ in a single coordinate? The problem of the existence of such a listing, which is called a cyclic ... 详细信息
来源: 评论