Scilit logo
  • Rankings
  • Search Publications
    Cited-by Search
  • Sources
  • Publishers
  • Scholars
    Top Cited Scholars
  • Organizations
  • Scilit
    About Us
    Advisory Board
    Data Sources
    Career
    Support / Contact
    User Guide
    Publisher User
    Search Function
    Rankings Function
    API Resource
    Scilit Knowledge
    Metrics
    Scilit Recognitions
    Publications Classification
    Media
    News
    Blog
Register
  1. Home
  2. Publications
  3. Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
  1. Home
  2. Publications
  3. Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets

Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets

Authors:
  • PBPeter Bürgisser
    Peter Bürgisser
  • FCFelipe Cucker
    Felipe Cucker
  • MLMartin Lotz
    Martin Lotz

Publisher website
Google Scholar
  • 13 June 2005
    • journal article
    • Published by Springer Nature in Foundations of Computational Mathematics
    • Vol. 5  (4) , 351-387
    • DOI:10.1007/s10208-005-0146-x
Abstract
No abstract available
Keywords
  • COMPLEXITY CLASSES
  • COUNTING PROBLEMS
  • EULER CHARACTERISTIC
Cited by 18 articles
Scilit logo

Have questions? Email us at support@scilit.com

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.

MDPI initiatives

  • MDPI Journals
  • MDPI Books
  • Sciforum
  • Proceedings Series
  • Preprints.org
  • SciProfiles
  • Encyclopedia
  • JAMS

Legal

  • Privacy
  • Terms
  • About
  • Contact
  • Disclaimer

Follow us

  • facebook icon
  • x icon
  • linkedin icon

Join us

  • Career

© 2026 MDPI (Basel, Switzerland) unless otherwise stated.