13383 search results - page 78 / 2677 » Abstractions from proofs |
SCHOLARPEDIA
2008
14 years 9 months ago
2008
ABSTRACT. We give a proof of the Sharkovsky Theorem that is selfcontained, short and direct and that illuminates the doubling structure of the Sharkovsky ordering.
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
146
click to vote
CC
2010
Springer
14 years 4 months ago
2010
Springer
We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for r...
NIPS
2008
14 years 11 months ago
2008
In this theoretical contribution we provide mathematical proof that two of the most important classes of network learning - correlation-based differential Hebbian learning and rew...
ANOR
2002
14 years 9 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...