2681 search results - page 99 / 537 » Problem F |
DAM
2008
13 years 10 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
ECCC
2010
13 years 10 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
FM
1997
Springer
14 years 2 months ago
1997
Springer
We describe a meta-method for formal method integration Pai97 . The approach is applied to combining formal methods with other formal and semiformal methods. We discuss the theory ...
RTA
1993
Springer
14 years 2 months ago
1993
Springer
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
CANS
2008
Springer
14 years 3 days ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...