The Logical Complexity of Geometric Properties in the Plane

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Logical Complexity of Geometric Properties in the Plane

Full text

Pdf (530 KB)

Source

Journal of the ACM (JACM) archive
Volume 17 , Issue 2 (April 1970) table of contents

Pages: 339 - 347

Year of Publication: 1970

ISSN:0004-5411

Author

Louis Hodes

Department of Health, Education and Welfare, Division of Computer Research and Technology, National Institue of Health, Public Health Service, Bethesda, Maryland

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 4

Additional Information:

references cited by index terms peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321574.321587 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	HODES, L., AND SPECKED, E. Lengths of formulas and elimination of quantifiers I. In Schutte, K. (ed.), Contributions to Mathematical Logic, North-Holland, Amsterdam, 1968, pp. 175-188.
	2	LUFANOV, O.B. Complexity of formula realization of functions of logical algebra. Problems of Cybernetics 3 (1962), 782-812.
	3	MINSKY, M., AND PAPERT, S. Linearly unrecognizable patterns. Proc. Syrup. in Appl. Math., Vol. 19, Amer. Math. Soc., Providence, R.I., 1967, pp. 176-218.
	4	NECIPOi~UK, E .E . A Boolean function. Soviet Math.--Doklady 7 (1966), 999-1000.
	5	RIORDAN, J., AND SHANNON, C .E . The number of two-terminal series-parallel networks. J. Math. Phys. 21, 2 (1942), 83-93.
	6	SPECK~R, E. Elimination von Quantoren und Lange yon Formeln {Abstract}. J. Symbolic Logic 32 (1967), 567-568.
	7	SUBBOTOVSKAJA, B.A. Realizations of linear functions by formulas using V, & --. Soviet Math.--Doklady 2 (1961), 110-112.

CITED BY 4

	Michael J. Fischer , Albert R. Meyer , Michael S. Paterson, Lower bounds on the size of Boolean formulas: Preliminary Report, Proceedings of seventh annual ACM symposium on Theory of computing, p.37-44, May 05-07, 1975, Albuquerque, New Mexico, United States
	Stanley M. Selkow, One-Pass Complexity of Digital Picture Properties, Journal of the ACM (JACM), v.19 n.2, p.283-295, April 1972
	J. P. Mylopoulos , T. Pavlidis, On the Topological Properties of Quantized Spaces, I. The Notion of Dimension, Journal of the ACM (JACM), v.18 n.2, p.239-246, April 1971
	Azriel Rosenfeld, Progress in Picture Processing: 1969--71, ACM Computing Surveys (CSUR), v.5 n.2, p.81-108, June 1973