Algorithmic Complexity of Mathematical Problems: An Overview of Results and Open Problems

被引：0
|
作者：
Calude, Cristian S. [1 ]
Calude, Elena [2 ]
机构：
[1] Univ Auckland, Dept Comp Sci, Auckland 1, New Zealand
[2] Massey Univ Auckland, Inst Nat & Math Sci, Auckland, New Zealand
来源：
INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING | 2013年 / 9卷 / 3-4期
关键词：
Classical and inductive computations; complexity of Pi(1)-statements and Pi(2)-statements;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper reviews current progress and open problems in algorithmically evaluating the complexity of a large class of mathematical problems/conjectures/statements.
引用
收藏
页码：327 / 343
页数：17
相关论文
共 50 条
  • [31] Complexity of strict robust integer minimum cost flow problems: An overview and further results
    Chassein, Andre
    Kinscherff, Anika
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 104 : 228 - 238
  • [32] Improved algorithmic results for unsplittable stable allocation problems
    Cseh, Agnes
    Dean, Brian C.
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (03) : 657 - 671
  • [33] Improved algorithmic results for unsplittable stable allocation problems
    Ágnes Cseh
    Brian C. Dean
    [J]. Journal of Combinatorial Optimization, 2016, 32 : 657 - 671
  • [34] Open Problems Related to Quantum Query Complexity
    Aaronson, Scott
    [J]. ACM TRANSACTIONS ON QUANTUM COMPUTING, 2021, 2 (04):
  • [35] Open problems in mathematical systems theory and control
    Blondel, V
    Krstic, M
    [J]. IEEE CONTROL SYSTEMS MAGAZINE, 2002, 22 (02): : 86 - 86
  • [36] The complexity results of the sparse optimization problems and reverse convex optimization problems
    Zhongyi Jiang
    Qiying Hu
    [J]. Optimization Letters, 2020, 14 : 2149 - 2160
  • [37] The complexity results of the sparse optimization problems and reverse convex optimization problems
    Jiang, Zhongyi
    Hu, Qiying
    [J]. OPTIMIZATION LETTERS, 2020, 14 (08) : 2149 - 2160
  • [38] A general framework for coloring problems: Old results, new results, and open problems
    Broersma, H
    [J]. COMBINATORIAL GEOMETRY AND GRAPH THEORY, 2005, 3330 : 65 - 79
  • [39] General Game Playing: An Overview and Open Problems
    Sharma, Shiven
    Kobti, Ziad
    Goodwin, Scott D.
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTING, ENGINEERING AND INFORMATION, 2009, : 257 - 260
  • [40] Algorithmic and complexity aspects of problems related to total restrained domination for graphs
    Yu Yang
    Cai-Xia Wang
    Shou-Jun Xu
    [J]. Journal of Combinatorial Optimization, 2023, 46
12345