Decision Problems and Complexity over a Ring

  • Lenore Blum
  • Felipe Cucker
  • Michael Shub
  • Steve Smale
Chapter

Abstract

Classical complexity theory deals primarily with combinatorial (discrete, integer) problems. We extend the theory here to consider a wider class of problems.

Keywords

Polynomial Time Decision Problem Problem Instance Complexity Theory Input Size 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Lenore Blum
    • 1
    • 2
  • Felipe Cucker
    • 2
    • 3
  • Michael Shub
    • 4
  • Steve Smale
    • 2
  1. 1.International Computer Science InstituteBerkeleyUSA
  2. 2.Department of MathematicsCity University of Hong KongKowloonHong Kong
  3. 3.Universitat Pompeu FabraBarcelonaSpain
  4. 4.IBM T.J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations