Proof, Completeness, Transcendentals, and Sampling

DOI10.1145/322003.322013zbMATH Open0359.68105OpenAlexW2042122214MaRDI QIDQ4131705FDOQ4131705

Authors: Philip J. Davis 

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322003.322013

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) General topics in the theory of software (68N01) Formal languages and automata (68Q45) Transcendence (general theory) (11J81)

Cited In (2)

• Solving geometrical constraint systems using CLP based on linear constraint solver
• On the algebraic formulation of certain geometry statements and mechanical geometry theorem proving

This page was built for publication: Proof, Completeness, Transcendentals, and Sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131705)