Sciweavers

13603 search results - page 288 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
JOC
2000
95views more  JOC 2000»
15 years 6 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
LOGCOM
2000
63views more  LOGCOM 2000»
15 years 6 months ago
Reflection principles in computational logic
We introduce the concept of reflection principle as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of l...
Jonas Barklund, Pierangelo Dell'Acqua, Stefania Co...
AML
1998
60views more  AML 1998»
15 years 6 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
ECCC
2010
98views more  ECCC 2010»
15 years 5 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
SIAMMAX
2011
180views more  SIAMMAX 2011»
15 years 1 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen