Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
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
Login
Register
Home
Publications
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
Home
Publications
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
Counting Complexity Classes for Numeric Computations. III: Complex Projective Sets
Authors:
PB
Peter Bürgisser
Peter Bürgisser
FC
Felipe Cucker
Felipe Cucker
ML
Martin Lotz
Martin Lotz
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
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
Cited by 18 articles
Scroll to top