Are lower bounds easier over the reals?

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1998, Pages 507-513

  Fournier, Herve ^a   Koiran, Pascal ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TOPOLOGY;

TOPOLOGICAL COMPLEXITY;

BOOLEAN ALGEBRA;

EID: 0031619859     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/276698.276864     Document Type: Conference Paper

References (22)