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 条
  • [21] Engineering the LOUDS succinct tree representation
    Delpratt, O'Neil
    Rahman, Naila
    Raman, Rajeev
    EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 134 - 145
  • [22] Succinct Representation of Static Packet Classifiers
    Lu, Wencheng
    Sahni, Sartaj
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2009, 17 (03) : 803 - 816
  • [23] SUCCINCT REPRESENTATION OF GENERAL UNLABELED GRAPHS
    NAOR, M
    DISCRETE APPLIED MATHEMATICS, 1990, 28 (03) : 303 - 307
  • [24] A practical succinct dynamic graph representation
    Coimbra, Miguel E.
    Hrotko, Joana
    Francisco, Alexandre P.
    Russo, Luis M. S.
    de Bernardo, Guillermo
    Ladra, Susana
    Navarro, Gonzalo
    INFORMATION AND COMPUTATION, 2022, 285
  • [25] Succinct representation of static packet classifiers
    Lu, Wencheng
    Sahni, Sartaj
    2007 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1-3, 2007, : 19 - 24
  • [26] SUCCINCT REPRESENTATION OF CODES WITH APPLICATIONS TO TESTING
    Grigorescu, Elena
    Kaufman, Tali
    Sudan, Madhu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1618 - 1634
  • [27] REPRESENTATION OF SOLUTION OF SEMILINEAR INITIAL VALUE-PROBLEMS IN INTEGRAL FORM
    REICHELT, P
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1975, 55 (10): : 613 - 613
  • [28] SUCCINCT REPRESENTATIONS OF COUNTING PROBLEMS
    TORAN, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 415 - 426
  • [29] The cell probe complexity of succinct data structures
    Gál, A
    Miltersen, PB
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 332 - 344
  • [30] The cell probe complexity of succinct data structures
    Gal, Anna
    Miltersen, Peter Bro
    THEORETICAL COMPUTER SCIENCE, 2007, 379 (03) : 405 - 417
12345