The complexity of semilinear problems in succinct representation

被引：0
|
作者：
Bürgisser, P
Cucker, F
de Naurois, PJ
机构：
[1] Univ Paderborn, Dept Math, D-33095 Paderborn, Germany
[2] City Univ Hong Kong, Dept Math, Hong Kong, Hong Kong, Peoples R China
[3] LORIA, F-54602 Nancy, France
来源：
FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS | 2005年 / 3623卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real constants are allowed in the circuit, the completeness results are for the Blum-Shub-Smale additive model of computation. If, in contrast, the circuit is constant-free, then the completeness results are for the Turing model of computation. One such result, the p(NP[log])-completeness of deciding Zariski irreducibility, exhibits for the first time a problem with a geometric nature complete in this class.
引用
收藏
页码：479 / 490
页数：12
相关论文
共 50 条
  • [1] The complexity of semilinear problems in succinct representation
    Buergisser, Peter
    Cucker, Felipe
    de Naurois, Paulin Jacobe
    COMPUTATIONAL COMPLEXITY, 2006, 15 (03) : 197 - 235
  • [2] The complexity of semilinear problems in succinct representation
    Peter Bürgisser
    Felipe Cucker
    Paulin Jacobé de Naurois
    computational complexity, 2006, 15 : 197 - 235
  • [3] THE COMPLEXITY OF COMBINATORIAL PROBLEMS WITH SUCCINCT INPUT REPRESENTATION
    WAGNER, KW
    ACTA INFORMATICA, 1986, 23 (03) : 325 - 356
  • [4] The Complexity of Succinct Elections
    Fitzsimmons, Zack
    Hemaspaandra, Edith
    THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2017, : 4921 - 4922
  • [5] ON THE SUCCINCT REPRESENTATION OF GRAPHS
    TURAN, G
    DISCRETE APPLIED MATHEMATICS, 1984, 8 (03) : 289 - 294
  • [6] Succinct Representation of Labeled Graphs
    Jérémy Barbay
    Luca Castelli Aleardi
    Meng He
    J. Ian Munro
    Algorithmica, 2012, 62 : 224 - 257
  • [7] Succinct representation of labeled graphs
    Barbay, Jeremy
    Aleardi, Luca Castelli
    He, Meng
    Munro, J. Ian
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 316 - +
  • [8] On Succinct Representation of Directed Graphs
    Parque, Victor
    Miyashita, Tomoyuki
    2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2017, : 199 - 205
  • [9] Succinct Representation of Binary Trees
    Miklos, Poth
    2008 6TH INTERNATIONAL SYMPOSIUM ON INTELLIGENT SYSTEMS AND INFORMATICS, 2008, : 234 - 237
  • [10] Succinct Representation of Labeled Graphs
    Barbay, Jeremy
    Aleardi, Luca Castelli
    He, Meng
    Munro, J. Ian
    ALGORITHMICA, 2012, 62 (1-2) : 224 - 257
12345