咨询与建议

限定检索结果

文献类型

  • 311 篇 期刊文献
  • 68 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 235 篇 理学
    • 232 篇 数学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 2 篇 物理学
  • 232 篇 工学
    • 191 篇 计算机科学与技术...
    • 38 篇 软件工程
    • 33 篇 电气工程
    • 17 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 2 篇 动力工程及工程热...
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 96 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 17 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 21 篇 经济学
    • 17 篇 应用经济学
    • 5 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 381 篇 polynomial-time ...
  • 36 篇 computational co...
  • 23 篇 np-completeness
  • 17 篇 np-hardness
  • 16 篇 np-hard
  • 16 篇 scheduling
  • 12 篇 np-complete
  • 11 篇 dynamic programm...
  • 10 篇 linear programmi...
  • 10 篇 graph theory
  • 9 篇 np-hard problem
  • 9 篇 independent set
  • 9 篇 combinatorial op...
  • 8 篇 approximation al...
  • 8 篇 stable matching
  • 7 篇 discrete tomogra...
  • 7 篇 matching
  • 7 篇 complexity
  • 6 篇 network
  • 5 篇 temporal graph

机构

  • 16 篇 univ warwick mat...
  • 15 篇 univ warwick dim...
  • 7 篇 rutgers state un...
  • 7 篇 univ durham dept...
  • 6 篇 univ glasgow dep...
  • 6 篇 hong kong polyte...
  • 6 篇 univ rostock ins...
  • 5 篇 natl res univ hi...
  • 4 篇 zhengzhou univ s...
  • 4 篇 univ g dannunzio...
  • 4 篇 kwansei gakuin u...
  • 4 篇 natl res univ hi...
  • 3 篇 univ ioannina de...
  • 3 篇 univ glasgow sch...
  • 3 篇 univ primorska u...
  • 3 篇 kyoto univ grad ...
  • 3 篇 russian acad sci...
  • 3 篇 ben gurion univ ...
  • 3 篇 univ wisconsin d...
  • 3 篇 univ wisconsin w...

作者

  • 15 篇 milanic martin
  • 13 篇 lozin vadim
  • 11 篇 lozin vadim v.
  • 10 篇 manlove david f.
  • 10 篇 malyshev d. s.
  • 10 篇 miwa hiroyoshi
  • 9 篇 mosca raffaele
  • 7 篇 paulusma daniel
  • 7 篇 brandstaedt andr...
  • 7 篇 kobayashi yusuke
  • 6 篇 mertzios george ...
  • 6 篇 ries bernard
  • 5 篇 purcell christop...
  • 5 篇 van iersel leo
  • 4 篇 lin lan
  • 4 篇 gritzmann p
  • 4 篇 maeda nao
  • 4 篇 golovach petr a.
  • 4 篇 del pia alberto
  • 4 篇 papadopoulos cha...

语言

  • 328 篇 英文
  • 51 篇 其他
  • 1 篇 土耳其文
  • 1 篇 中文
检索条件"主题词=Polynomial-time algorithm"
381 条 记 录,以下是261-270 订阅
排序:
On computing the closures of solvable permutation groups
收藏 引用
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION 2024年 第1期34卷 137-145页
作者: Ponomarenko, Ilia Vasil'ev, Andrey V. Steklov Math Inst St Petersburg Dept 27 Fontanka St Petersburg 191023 Russia Sobolev Inst Math 4 Acad Koptyug Ave Novosibirsk 630090 Russia
Let m >= 3 be an integer. It is proved that the m-closure of a given solvable permutation group of degree n can be constructed in time nO(m).
来源: 评论
Systems of equations with a single solution
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2015年 第Part2期68卷 116-130页
作者: Esterov, Alexander Gusev, Gleb Natl Res Univ Higher Sch Econ Fac Math Moscow 117312 Russia Natl Res Univ Higher Sch Econ Fac Math Moscow 117312 Russia State Univ Moscow Inst Phys & Technol Dept Innovat & High Technol Dolgoprudnyi 141700 Moscow Region Russia
We classify generic systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorith... 详细信息
来源: 评论
Fast algorithm for the Rainbow Disconnection Coloring of 2-Trees
收藏 引用
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA 2023年 1-13页
作者: Bai, Xu-Qing Li, Bi Xu, Chuan-Dong Zhang, Xin Xidian Univ Sch Math & Stat Xian 710071 Shaanxi Peoples R China
Given a connected graph G = (V, E), a rainbow disconnection k-coloring of G is a k-edge coloring of G such that for each pair of vertices u, v is an element of V, there is a rainbow (edge) cut of u, v, which is a subs... 详细信息
来源: 评论
Efficient algorithms for the recognition of topologically conjugate gradient-like diffeomorhisms
收藏 引用
REGULAR & CHAOTIC DYNAMICS 2016年 第2期21卷 189-203页
作者: Grines, Vyacheslav Z. Malyshev, Dmitry S. Pochinka, Olga V. Zinina, Svetlana Kh. Natl Res Univ Higher Sch Econ Ul Bolshaya Pecherskaya 25-12 Nizhnii Novgorod 603155 Russia NI Lobachevsky State Univ Nizhni Novgorod Ul Gagarina 23 Nizhnii Novgorod 603950 Russia Ogarev Mordovia State Univ Ul Bolshevistskaya 68 Saransk 430005 Russia
It is well known that the topological classification of structurally stable flows on surfaces as well as the topological classification of some multidimensional gradient-like systems can be reduced to a combinatorial ... 详细信息
来源: 评论
Popular matchings in the weighted capacitated house allocation problem
收藏 引用
JOURNAL OF DISCRETE algorithmS 2010年 第2期8卷 102-116页
作者: Sng, Colin T. S. Manlove, David F. Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland
We consider the problem of finding a popular matching in the Weighted Capacitated House Allocation problem (WCHA). An instance of WCHA involves a set of agents and a set of houses. Each agent has a positive weight ind... 详细信息
来源: 评论
Finding edge-disjoint paths in partial k-trees
收藏 引用
algorithmICA 2000年 第1期26卷 3-30页
作者: Zhou, X Tamura, S Nishizeki, T Tohoku Univ Grad Sch Informat Sci Sendai Miyagi 9808579 Japan
For a given graph G and p pairs (s(i), t(i)), 1 less than or equal to i less than or equal to p, of vertices in G, the edge-disjoint paths problem is to find p pairwise edge-disjoint paths P-i, 1 less than or equal to... 详细信息
来源: 评论
Mind the independence gap
收藏 引用
DISCRETE MATHEMATICS 2020年 第9期343卷 111943-111943页
作者: Ekim, Tinaz Gozupek, Didem Hujdurovic, Ademir Milanic, Martin Bogazici Univ Dept Ind Engn Istanbul Turkey Gebze Tech Univ Dept Comp Engn Kocaeli Turkey Univ Primorska UP IAM Muzejski Trg 2 SI-6000 Koper Slovenia Univ Primorska UP FAMNIT Glagoljaska 8 SI-6000 Koper Slovenia
The independence gap of a graph was introduced by Ekim et al. in 2018 as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal indep... 详细信息
来源: 评论
An algorithm for the Polyhedral Cycle Cover Problem with Constraints on the Number and Length of Cycles
收藏 引用
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 2019年 第SUPPL 1期307卷 142-150页
作者: Shenmaier, V. V. Russian Acad Sci Siberian Branch Sobolev Inst Math Novosibirsk 630090 Russia
A cycle cover of a graph is a spanning subgraph whose connected components are simple cycles. Given a complete weighted directed graph, consider the intractable problem of finding a maximum-weight cycle cover which sa... 详细信息
来源: 评论
Finding a cycle base of a permutation group in polynomial time
收藏 引用
JOURNAL OF ALGEBRA 2018年 510卷 542-561页
作者: Muzychuk, Mikhail Ponomarenko, Ilia Ben Gurion Univ Negev Beer Sheva Israel Steklov Inst Math St Petersburg St Petersburg Russia
A cycle base of a permutation group is defined to be a maximal set of its pairwise non-conjugate regular cyclic subgroups. It is proved in this paper that a cycle base of a permutation group of degree n can be constru... 详细信息
来源: 评论
AN algorithm TO COMPUTE THE SUPREMUM OF MAX-MIN POWERS AND A PROPERTY OF FUZZY GRAPHS
收藏 引用
PATTERN RECOGNITION LETTERS 1991年 第7期12卷 413-420页
作者: BHATTACHARYA, P SURAWEERA, F GRIFFITH UNIV SCH COMP & INFORMAT TECHNOLNATHANQLD 4111AUSTRALIA
We obtain a polynomial-time algorithm to compute the supremum of the max-min powers of a map from the Cartesian product of a set to a bounded subset of the real numbers. It is also shown that the value at a pair (x, y... 详细信息
来源: 评论