Skip to main content

The complexity of semilinear problems in succinct representation


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 PNP[log]-completeness of deciding Zariski irreducibility, exhibits for the first time a problem with a geometric nature complete in this class.

This is a preview of subscription content, access via your institution.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Peter Bürgisser.

Additional information

Manuscript received 3 March 2005, revised 12 March 2006

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Bürgisser, P., Cucker, F. & de Naurois, P.J. The complexity of semilinear problems in succinct representation. comput. complex. 15, 197–235 (2006).

Download citation

  • Issue Date:

  • DOI:


  • BSS additive model
  • semilinear sets
  • complete problems

Subject classification.

  • 68Q15