咨询与建议

限定检索结果

文献类型

  • 239 篇 期刊文献
  • 43 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 165 篇 工学
    • 130 篇 计算机科学与技术...
    • 30 篇 电气工程
    • 26 篇 软件工程
    • 15 篇 电子科学与技术(可...
    • 9 篇 机械工程
    • 9 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 3 篇 石油与天然气工程
    • 2 篇 动力工程及工程热...
    • 2 篇 交通运输工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
  • 164 篇 理学
    • 163 篇 数学
    • 3 篇 系统科学
    • 2 篇 生物学
    • 2 篇 统计学(可授理学、...
  • 88 篇 管理学
    • 88 篇 管理科学与工程(可...
    • 19 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 19 篇 经济学
    • 17 篇 应用经济学
    • 2 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 2 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 2 篇 军事学
  • 1 篇 农学

主题

  • 282 篇 polynomial time ...
  • 21 篇 np-complete
  • 19 篇 computational co...
  • 17 篇 scheduling
  • 13 篇 approximation al...
  • 12 篇 np-completeness
  • 11 篇 domination
  • 11 篇 combinatorial op...
  • 7 篇 np-hard
  • 7 篇 discrete tomogra...
  • 7 篇 complexity
  • 6 篇 efficient edge d...
  • 6 篇 traveling salesm...
  • 6 篇 graph algorithms
  • 6 篇 dynamic programm...
  • 6 篇 dominating induc...
  • 5 篇 shortest path
  • 5 篇 np-hardness
  • 4 篇 maximum flow
  • 4 篇 equivalence

机构

  • 13 篇 univ g dannunzio...
  • 7 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 univ rostock ins...
  • 5 篇 zhejiang normal ...
  • 4 篇 univ primorska u...
  • 4 篇 indian inst tech...
  • 4 篇 univ primorska u...
  • 3 篇 lanzhou univ sch...
  • 3 篇 univ debrecen in...
  • 3 篇 simon fraser uni...
  • 3 篇 jaist sch inform...
  • 3 篇 kyushu int univ ...
  • 3 篇 kyushu univ dept...
  • 3 篇 univ victoria de...
  • 3 篇 univ warwick war...
  • 3 篇 hiroshima city u...
  • 3 篇 xinjiang univ co...
  • 2 篇 univ calif berke...
  • 2 篇 w virginia univ ...

作者

  • 15 篇 mosca raffaele
  • 12 篇 brandstaedt andr...
  • 9 篇 pradhan d.
  • 8 篇 akbalik ayse
  • 6 篇 rapine christoph...
  • 6 篇 uehara ryuhei
  • 6 篇 milanic martin
  • 6 篇 panda b. s.
  • 6 篇 woeginger gj
  • 5 篇 zhang zhao
  • 5 篇 saitoh toshiki
  • 5 篇 banerjee s.
  • 5 篇 shoudai takayosh...
  • 4 篇 suzuki yusuke
  • 4 篇 frosini a.
  • 4 篇 huang jing
  • 4 篇 kiyomi masashi
  • 4 篇 penz bernard
  • 4 篇 uchida tomoyuki
  • 4 篇 jarray fethi

语言

  • 250 篇 英文
  • 31 篇 其他
检索条件"主题词=Polynomial time algorithm"
282 条 记 录,以下是221-230 订阅
排序:
An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections
收藏 引用
Electronic Notes in Discrete Mathematics 2005年 20卷 347-363页
作者: Frosini, A. Rinaldi, S. Barcucci, E. Kuba, A. Dipartimento di Scienze Matematiche e Informatiche University of Siena Siena Italy Dipartimento di Sistemi e Informatica University of Florence Florence Italy Dept. of Image Proc. and Computer Graphics Univ. of Szeged Szeged Hungary
This paper studies the classical tomographical problem of the reconstruction of a binary matrix from projections in presence of absorption. In particular, we consider two projections along the horizontal and vertical ... 详细信息
来源: 评论
How many disjoint 2-edge paths must a cubic graph have?
收藏 引用
JOURNAL OF GRAPH THEORY 2004年 第1期45卷 57-79页
作者: Kelmans, A Mubayi, D Rutgers State Univ New Brunswick NJ 08903 USA Univ Puerto Rico San Juan PR 00936 USA Univ Illinois Dept Math Stat & Comp Sci Chicago IL 60607 USA
In this paper we show that every simple cubic graph on n vertices has a set of at least [n/4] disjoint 2-edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set i... 详细信息
来源: 评论
Seventeen lines and one-hundred-and-one points
收藏 引用
THEORETICAL COMPUTER SCIENCE 2004年 第2-3期321卷 415-421页
作者: Woeginger, GJ Univ Twente Dept Math NL-7500 AE Enschede Netherlands
We investigate a curious problem from additive number theory: Given two positive integers S and Q, does there exist a sequence of positive integers that add up to S and whose squares add up to Q? We show that this pro... 详细信息
来源: 评论
A dual criteria preemptive scheduling problem for minimax error of imprecise computation tasks
收藏 引用
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2004年 第5期15卷 717-731页
作者: Ho, KIJ Leung, JYT Chun Shan Med Univ Dept Informat Management Taichung Taiwan New Jersey Inst Technol Dept Comp Sci Newark NJ 07102 USA
We consider a hierarchical optimization problem for imprecise computation tasks, where each task is weighted with two weights, w and w'. The primary criterion is to minimize the total w-weighted error of all optio... 详细信息
来源: 评论
Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job"
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年 第1期157卷 257-261页
作者: Mosheiov, G Yovel, U Hebrew Univ Jerusalem Sch Business Adm IL-91905 Jerusalem Israel Hebrew Univ Jerusalem Dept Stat IL-91905 Jerusalem Israel Hebrew Univ Jerusalem Dept Comp Sci IL-91904 Jerusalem Israel
A recent paper [Eur. J. Operat. Res. 127 (2000) 120] addresses a flow-shop scheduling problem, where (i) each of the it jobs is limited to at most two operations, and (ii) one of these operations is common for all the... 详细信息
来源: 评论
polynomial time algorithms for Determining Optimal Strategies
收藏 引用
Electronic Notes in Discrete Mathematics 2003年 13卷 64-68页
作者: Lozovanu, Dmitrii Pickl, Stefan Institute of Mathematics and Computer Science Academy of Sciences Academy str. MD-2028 Moldova 5 Kishinev Germany Institute of Mathematics Center of Applied Computer Science University of Cologne Germany
We study the multiobjective control of time-discrete systems with given starting and final states. The dynamics of the system is controled by p actors (players) which intend to minimize their integral-time costs of sy... 详细信息
来源: 评论
A polynomially Solvable Special Case of the Knapsack Sharing Problem
A Polynomially Solvable Special Case of the Knapsack Sharing...
收藏 引用
中国运筹学会第七届学术交流会
作者: Cuilian Wu Yuzhong Zhang College of Operations Research and Management Science,Qufu Normal University,Rizhao,Shangdong, 276826
n this paper, a polynomial algorithm for a special case of knapsack sharingproblem is presented by decomposing it into a series of multidimentional knapsackproblems, without the assumption that the number of the const... 详细信息
来源: 评论
Efficient algorithms for NMR quantum computers with small qubits
收藏 引用
NEW GENERATION COMPUTING 2003年 第4期21卷 329-337页
作者: Kunihiro, N Yamashita, S Univ Electrocommun Chofu Tokyo 1828585 Japan Nara Inst Sci & Technol Nara 6310101 Japan
The security of the RSA cryptosystems is based on the difficulty of factoring a large composite integer. In 1994, Shor showed that factoring a large composite is executable in polynomial time if we use a quantum Turin... 详细信息
来源: 评论
PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
收藏 引用
JOURNAL OF ALGEBRA AND ITS APPLICATIONS 2003年 第2期2卷 137-163页
作者: Almeida, J. Volkov, M. V. Univ Porto Fac Ciencias Dept Math Pura P-4169007 Oporto Portugal Ural State Univ Dept Math & Mech Ekaterinburg 620083 Russia
We introduce a series of new polynomially computable implicit operations on the class of all finite semigroups. These new operations enable us to construct a finite pro-identity basis for the pseudovariety (H) over ba... 详细信息
来源: 评论
polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
收藏 引用
THEORETICAL COMPUTER SCIENCE 2002年 第1期289卷 503-516页
作者: Fleischner, H Kullmann, O Szeider, S Austrian Acad Sci Inst Discrete Math A-1010 Vienna Austria Univ Coll Swansea Dept Comp Sci Swansea SA2 8PP W Glam Wales
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the difference of the number of clauses an... 详细信息
来源: 评论