Sciweavers

281 search results - page 2 / 57
» The Proof Complexity of Linear Algebra
Sort
View
PODS
2005
ACM
118views Database» more  PODS 2005»
14 years 5 months ago
On the complexity of division and set joins in the relational algebra
We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, constant-tagging, and joins, must produce ...
Dirk Leinders, Jan Van den Bussche
CSL
2010
Springer
13 years 6 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
ENTCS
2010
105views more  ENTCS 2010»
13 years 5 months ago
From Focalization of Logic to the Logic of Focalization
Focalization property is a deep outcome of linear logic proof theory, putting to the foreground the role of polarity in logic. It resulted an important advances in various fields, ...
Michele Basaldella, Alexis Saurin, Kazushige Terui
COMBINATORICS
2007
85views more  COMBINATORICS 2007»
13 years 5 months ago
Eigenvectors and Reconstruction
In this paper, we study the simple eigenvectors of two hypomorphic matrices using linear algebra. We also give new proofs of results of Godsil and McKay.
Hongyu He
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 5 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett