Sciweavers

13603 search results - page 166 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
JIPS
2007
131views more  JIPS 2007»
15 years 6 months ago
A Practical Privacy-Preserving Cooperative Computation Protocol without Oblivious Transfer for Linear Systems of Equations
: We propose several practical SMC protocols for privacy-preserving cooperative scientific computations. We consider two important scientific computations which involve linear equa...
Ju-Sung Kang, Dowon Hong
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 6 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
EATCS
1998
250views more  EATCS 1998»
15 years 6 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 6 months ago
A Computational Framework for the Near Elimination of Spreadsheet Risk
We present Risk Integrated's Enterprise Spreadsheet Platform (ESP), a technical approach to the near-elimination of spreadsheet risk in the enterprise computing environment, ...
Yusuf Jafry, Fredrika Sidoroff, Roger Chi
TCOS
2008
15 years 6 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang