Skip to main content
Log in

A measure for semialgebraic sets related to Boolean complexity

  • Published:
Mathematische Annalen Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  • [B1] Bröcker L.: Minimal generation of basic semialgebraic sets. Rocky Mt. J. Math.14 (No. 4), 935–938 (1984)

    Google Scholar 

  • [B2] Bröcker, L.: Minimale Erzeugung von Positivbereichen. Geom. Dedicata16 (no. 3), 335–350 (1984)

    Google Scholar 

  • [BE] Bochnak, J., Efroymson, G.: Real algebraic geometry and the 17th Hilbert problem. Math. Ann.251, 213–241 (1980)

    Article  Google Scholar 

  • [C] Coote, M.: Ensembles Semi-algebrique et fonctions de Nash. Seminaire de geometrie reelle de Paris 7, Fascicole no. 18, Ferrier (1981)

  • [H] Halmos, P.: Measure theory. New York: Van Nostrand 1950

    Google Scholar 

  • [M] Mostowski, T.: Some properties of the ring of Nash functions. Ann. Sc. Norm. Super., Pisa, Cl. Sci., IV. Ser. Sci.24, 597–632 (1970)

    Google Scholar 

  • [S] Stengle, G.: A lower bound for the complexity of separating functions Rocky Mt. J. Math.14 (no. 4), 927–929 (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stengle, G. A measure for semialgebraic sets related to Boolean complexity. Math. Ann. 283, 203–209 (1989). https://doi.org/10.1007/BF01446431

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01446431

Keywords

Navigation