✦ LIBER ✦

Upper bounds on complexity of Frege proofs with limited use of certain schemata

✍ Scribed by Pavel Naumov

Publisher: Springer
Year: 2005
Tongue: English
Weight: 197 KB
Volume: 45
Category: Article
ISSN: 0933-5846
DOI: 10.1007/s00153-005-0325-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Estimate of the upper bound on the Gauss

Estimate of the upper bound on the Gaussian curvature of certain surfaces with boundary

✍ L. I. Vorob'eva 📂 Article 📅 1976 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 299 KB

An upper bound on the sample complexity

An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution

✍ Philip M. Long 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We show that halfspaces in n dimensions can be PAC-learned with respect to the uniform distribution with accuracy ε and confidence δ using O( 1 ε (n + log 1 δ )) examples.