Abstract not found

/non-Hamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given

this paper we only deal with the cases A = Z and A = Z[Z 2 ], so assume that A is commutative

Abstract. This article introduces the absolute quadratic complex formed by all lines that intersect the absolute conic. If ω denotes the 3 × 3 symmetric matrix representing the image of that conic under the action of a camera with projection matrix P, it is shown that ω ≈ PΩP T, where P is the 3

SeDuMi is an add-on for MATLAB, that lets you solve optimization problems with linear, quadratic and semidefiniteness constraints. It is possible to have complex valued data and variables in SeDuMi. Moreover, large scale optimization problems are solved efficiently, by exploiting sparsity

quadratic programming, semidefinite programming, and nonconvex and nonlinear problems, have reached varying levels of maturity. We review some of the key developments in the area, including comments on both the complexity theory and practical algorithms for linear programming, semidefinite programming

use. In this paper we present new algorithmic techniques that substantially improve the running time of the belief propagation approach. One of our techniques reduces the complexity of the inference algorithm to be linear rather than quadratic in the number of possible labels for each pixel, which

the complementary issue of designing classification algorithms that can deal with more complex outputs, such as trees, sequences, or sets. More generally, we consider problems involving multiple dependent output variables, structured output spaces, and classification problems with class attributes. In order

We construct the coarse moduli space Mqc(σ) of quadratic line complexes with a fixed Segre symbol σ as well as the moduli space Mss(σ) of the corresponding singular surfaces. We show that the map associating to a quadratic line complex its singular surface induces a morphism π: Mqc(σ) → Mss

We provide a lower bound construction showing that the union of unit balls in R³ has quadratic complexity, even if they all contain the origin. This settles a conjecture of Sharir.