36 search results - page 1 / 8 » Polynomial-time Algorithms from Ineffective Proofs |
104
click to vote
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
122
click to vote
STOC
1989
ACM
15 years 3 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
IS
2010
14 years 10 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
101
click to vote
CSL
2010
Springer
15 years 20 days ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
127
click to vote
STOC
2010
ACM
15 years 3 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...