191 search results - page 10 / 39 » The basic feasible functionals in computable analysis |
JSYML
2002
14 years 11 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
VLSI
2010
Springer
14 years 6 months ago
2010
Springer
Electro-Magnetic Analysis has been identified as an efficient technique to retrieve the secret key of cryptographic algorithms. Although similar mathematically speaking, Power or E...
105
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We examine the combination of two directions in the field of privacy concerning computations over distributed private inputs – secure function evaluation (SFE) and differential...
CSCWD
2005
Springer
15 years 1 months ago
2005
Springer
This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix de...