Circuits versus Trees in Algebraic Complexity

  • Pascal Koiran
Conference paper

DOI: 10.1007/3-540-46541-3_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Koiran P. (2000) Circuits versus Trees in Algebraic Complexity. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

This survey is devoted to some aspects of the “P = NP ?” problem over the real numbers and more general algebraic structures. We argue that given a structure M, it is important to find out whether NPM problems can be solved by polynomial depth computation trees, and if so whether these trees can be efficiently simulated by circuits. Point location, a problem of computational geometry, comes into play in the study of these questions for several structures of interest.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Pascal Koiran
    • 1
  1. 1.LIPEcole Normale Supérieure de LyonLyon Cedex 07France

Personalised recommendations