Sciweavers

276 search results - page 5 / 56
» A Matrix Characterization for MELL
Sort
View
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
15 years 1 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf
CADE
1997
Springer
15 years 1 months ago
Connection-Based Proof Construction in Linear Logic
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic. On this basis we develop a matrix-based proof search procedure for this fra...
Christoph Kreitz, Heiko Mantel, Jens Otten, Stepha...
ECCV
2006
Springer
15 years 1 months ago
The Space of Multibody Fundamental Matrices: Rank, Geometry and Projection
We study the rank and geometry of the multibody fundamental matrix, a geometric entity characterizing the two-view geometry of dynamic scenes consisting of multiple rigidbody moti...
Xiaodong Fan, René Vidal
ECCC
1998
117views more  ECCC 1998»
14 years 9 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
DCC
2011
IEEE
14 years 1 months ago
Hadamard matrices of order 32 and extremal ternary self-dual codes
A ternary self-dual code can be constructed from a Hadamard matrix of order congruent to 8 modulo 12. In this paper, we show that the Paley-Hadamard matrix is the only Hadamard ma...
Koichi Betsumiya, Masaaki Harada, Hiroshi Kimura