NONLINEAR ALGEBRA AND OPTIMIZATION ON RINGS ARE HARD

被引：4
|
作者：
HUNT, HB
STEARNS, RE
机构：
来源：
SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 05期
关键词：
Computer metatheory - Optimization;
D O I：
10.1137/0216059
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Several general NP- or coNP-hardness results are presented for nonlinear algebraic and optimization problems on rings. Several additional related nonlinear problems for such rings are shown to be NP-, coNP-, or #P-hard. In particular, a variant of Hilbert's Tenth Problem is shown to be NP-complete.
引用
收藏
页码：910 / 929
页数：20
相关论文
共 50 条
  • [1] Quantum approximate optimization for hard problems in linear algebra
    Borle, Ajinkya
    Elfving, Vincent E.
    Lomonaco, Samuel J.
    SCIPOST PHYSICS CORE, 2021, 4 (04):
  • [2] INTUITIONISTIC ALGEBRA AND REPRESENTATIONS OF RINGS
    MULVEY, C
    MEMOIRS OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, (148) : 3 - 57
  • [3] Computer algebra with Rings library
    Poslavsky, Stanislav
    19TH INTERNATIONAL WORKSHOP ON ADVANCED COMPUTING AND ANALYSIS TECHNIQUES IN PHYSICS RESEARCH, 2020, 1525
  • [4] An Algebra Description for Hard Clustering
    Wang, Bo
    Shi, Yong
    Yang, Zhuofan
    Ju, Xuchan
    DATA SCIENCE, 2015, 9208 : 62 - 69
  • [5] Cubic rings and the exceptional Jordan algebra
    Elkies, ND
    Gross, BH
    DUKE MATHEMATICAL JOURNAL, 2001, 109 (02) : 383 - 409
  • [6] Multilinear algebra over supersymmetric rings
    Brini, A
    Regonati, F
    Teolis, AGB
    ADVANCES IN MATHEMATICS, 1999, 145 (01) : 98 - 158
  • [7] Rings graded equivalent to the Weyl algebra
    Sierra, Susan J.
    JOURNAL OF ALGEBRA, 2009, 321 (02) : 495 - 531
  • [8] Integers, polynomials, and rings: A course in algebra
    Shiu, P.
    MATHEMATICAL GAZETTE, 2005, 89 (516): : 563 - 563
  • [9] Lie rings and Lie algebra bundles
    Kiranagi, B. S.
    NEARRINGS, NEARFIELDS AND RELATED TOPICS, 2017, : 231 - 247
  • [10] The skein algebra of the Borromean rings complement
    Miura, Go
    Suzuki, Sakie
    INTERNATIONAL JOURNAL OF MATHEMATICS, 2022, 33 (08)
12345