咨询与建议

限定检索结果

文献类型

  • 15 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 13 篇 理学
    • 7 篇 数学
    • 5 篇 物理学
    • 1 篇 化学
    • 1 篇 生物学
    • 1 篇 统计学(可授理学、...
  • 9 篇 工学
    • 7 篇 计算机科学与技术...
    • 2 篇 电子科学与技术(可...
    • 1 篇 仪器科学与技术
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
  • 2 篇 管理学
    • 2 篇 管理科学与工程(可...

主题

  • 16 篇 computational-co...
  • 4 篇 complexity class...
  • 2 篇 model
  • 2 篇 monte-carlo
  • 2 篇 algorithm
  • 2 篇 geometry
  • 1 篇 docking
  • 1 篇 deletions
  • 1 篇 computer
  • 1 篇 aperture-angle
  • 1 篇 principle
  • 1 篇 edges
  • 1 篇 trees
  • 1 篇 2 variables
  • 1 篇 inference engine...
  • 1 篇 minimum descript...
  • 1 篇 terminological r...
  • 1 篇 multirate
  • 1 篇 programs
  • 1 篇 satisfiability p...

机构

  • 2 篇 univ roma la sap...
  • 1 篇 departamento de ...
  • 1 篇 max planck inst ...
  • 1 篇 school of comput...
  • 1 篇 univ roma la sap...
  • 1 篇 univ aquila dipa...
  • 1 篇 univ rome dipart...
  • 1 篇 univ calif san d...
  • 1 篇 univ warwick dep...
  • 1 篇 univ edinburgh d...
  • 1 篇 univ akron akron...
  • 1 篇 univ calif san d...
  • 1 篇 dfki gmbh german...
  • 1 篇 []department of ...
  • 1 篇 univ innsbruck i...
  • 1 篇 inst natl rech i...
  • 1 篇 austrian acad sc...
  • 1 篇 moscow mv lomono...
  • 1 篇 pct umr gulliver...
  • 1 篇 w virginia univ ...

作者

  • 1 篇 lenka zdeborová
  • 1 篇 goldberg leslie ...
  • 1 篇 martin weigel
  • 1 篇 marchetti-spacca...
  • 1 篇 tsinghua univers...
  • 1 篇 jerrum mark
  • 1 篇 bruton leonard t...
  • 1 篇 omaña-pulido els...
  • 1 篇 vianu v
  • 1 篇 lenzerini m
  • 1 篇 brooks j. paul
  • 1 篇 duer w.
  • 1 篇 nutt w
  • 1 篇 donini fm
  • 1 篇 frigioni d
  • 1 篇 van den nest m.
  • 1 篇 china
  • 1 篇 toussaint godfri...
  • 1 篇 dynnikov ia
  • 1 篇 florent krząkała

语言

  • 15 篇 英文
  • 1 篇 其他
检索条件"主题词=computational-complexity"
16 条 记 录,以下是11-20 订阅
排序:
Extremal optimization at the phase transition of the three-coloring problem
收藏 引用
Physical Review E 2004年 第6期69卷 066703-066703页
作者: Stefan Boettcher Allon G. Percus []Department of Physics Emory University Atlanta Georgia 30322 USA
We investigate the phase transition in vertex coloring on random graphs, using the extremal optimization heuristic. Three-coloring is among the hardest combinatorial optimization problems and is equivalent to a 3-stat... 详细信息
来源: 评论
Recognition algorithms in knot theory
收藏 引用
RUSSIAN MATHEMATICAL SURVEYS 2003年 第6期58卷 1093-1139页
作者: Dynnikov, IA Moscow MV Lomonosov State Univ Lab Int Franco Russe Math & Interact Informat & P Moscow Russia
In this paper the problem of constructing algorithms for comparing knots and links is discussed. A survey of existing approaches and basic results in this area is given. In particular, diverse combinatorial methods fo... 详细信息
来源: 评论
Aperture-Angle Optimization Problems in Three Dimensions
收藏 引用
Journal of Mathematical Modelling and Algorithms 2002年 第4期1卷 301-329页
作者: Omaña-Pulido, Elsa Toussaint, Godfried T. Departamento de Matemáticas Universidad Autónoma de México Iztapalapa Mexico School of Computer Science McGill University Montreal QC H3A 2A7 3480 University Street Canada
Let [a,b] be a line segment with end points a, b and ν a point at which a viewer is located, all in R 3. The aperture angle of [a,b] from point ν, denoted by θ(ν), is the interior angle at ν of the triangle Δ(a... 详细信息
来源: 评论
Fully dynamic algorithms for maintaining shortest paths trees
收藏 引用
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC 2000年 第2期34卷 251-281页
作者: Frigioni, D Marchetti-Spaccamela, A Nanni, U Univ Aquila Dipartimento Ingn Elettr I-67040 Laquila Italy Univ Rome Dipartimento Informat & Sistemist I-00198 Rome Italy Univ Roma La Sapienza Dipartimento Informat & Sistemist I-00198 Rome Italy
We propose fully dynamic algorithms for maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions... 详细信息
来源: 评论
Reflective relational machines
收藏 引用
INFORMATION AND COMPUTATION 1998年 第2期143卷 110-136页
作者: Abiteboul, S Papadimitriou, CH Vianu, V Inst Natl Rech Informat & Automat F-78153 Le Chesnay France Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA Univ Calif San Diego CSE 0114 La Jolla CA 92093 USA
We propose a model of database programming with reflection (dynamic generation of queries within the host programming language), called the reflective relational machine, and characterize the power of this machine in ... 详细信息
来源: 评论
The complexity of concept languages
收藏 引用
INFORMATION AND COMPUTATION 1997年 第1期134卷 1-58页
作者: Donini, FM Lenzerini, M Nardi, D Nutt, W UNIV ROMA LA SAPIENZA DIPARTIMENTO INFORMAT & SISTEMIST I-00198 ROME ITALY DFKI GMBH GERMAN RES CTR ARTIFICIAL INTELLIGENCE D-66123 SAARBRUCKEN GERMANY
A basic feature of Terminological Knowledge Representation Systems is to represent knowledge by means of taxonomies, here called terminologies, and to provide a specialized reasoning engine to do inferences on these s... 详细信息
来源: 评论