The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful

not (explicitly) use PCPs. But his scheme has some disadvantages – namely, the CRS size and prover computation are both quadratic in the circuit size. In 2011, Lipmaa reduced the CRS size to quasi-linear, but with prover computation still quadratic. Using QSPs we construct a NIZK argument in the CRS model

Abstract. If α is an irrational number, we let {pn/qn}n≥0, be the approx-imants given by its continued fraction expansion. The Bruno series B(α) is defined as B(α) = n≥0 log qn+1 qn The quadratic polynomial Pα: z 7 → e2ipiαz + z2 has an indifferent fixed point at the origin. If Pα is linearizable

approximation, we demonstrate the effi-cacy of a sequential quadratic programming (SQP) solu-tion method. For cases where accuracy greater than that provided by the Elmore delay approximation is required, we apply SQP to the gate and wire sizing problem with more accurate delay models. Since efficient

preprocessing step of some fixed small cost. Then, for each generation, the time complexity is quadratic for exact-size uniform sampling and linear for approximate-size sampling. This greatly improves on the best previously known time complexity for exact-size uniform sampling of planar graphs with n vertices

Abstract—In this paper, we present a completely new approach to the problem of delay minimization by simultaneous buffer insertion and wire sizing for a wire. We show that the problem can be formulated as a convex quadratic program, which is known to be solvable in polynomial time. Nevertheless, we

that corrupts any minority of the parties. The total number of bits broadcast is O(nk|C|), where k is the security parameter and |C | is the size of a (Boolean) circuit computing the function to be securely evaluated. An earlier proposal by Franklin and Haber with the same complexity was only secure for passive

We investigate several topics on a quadratic form Φ over an algebraic number field including the following three: (A) an equation ξΦ · t ξ = Ψ for another form Ψ of a smaller size; (B) classification of Φ over the ring of algebraic integers; (C) ternary forms. In (A) we show that the “class

kernels of finite size have been introduced. This paper compares 1) truncated and windowed sinc; 2) nearest neighbor; 3) linear; 4) quadratic; 5) cubic B-spline; 6) cubic; g) Lagrange; and 7) Gaussian interpolation and approximation techniques with kernel sizes from 1 2 1upto 8 2 8. The comparison is done

If α is an irrational number, we let {pn/qn}n≥0, be the approximants given by its continued fraction expansion. The Bruno series B(α) is defined as ∑ log qn+1 B(α) =. n≥0 The quadratic polynomial Pα: z ↦ → e 2iπα z+z 2 has an indifferent fixed point at the origin. If Pα is linearizable, we let r