Sciweavers

347 search results - page 14 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
FUIN
2006
89views more  FUIN 2006»
14 years 11 months ago
Recursive Analysis Characterized as a Class of Real Recursive Functions
Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive a...
Olivier Bournez, Emmanuel Hainry
CORR
2007
Springer
97views Education» more  CORR 2007»
14 years 11 months ago
Estimation of the Rate-Distortion Function
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
Matthew T. Harrison, Ioannis Kontoyiannis
MFCS
2009
Springer
15 years 4 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
15 years 6 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
EOR
2010
101views more  EOR 2010»
14 years 6 months ago
A linear implementation of PACMAN
PACMAN (Passive and Active Compensability Multicriteria ANalysis) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensabili...
Silvia Angilella, Alfio Giarlotta, Fabio Lamantia