Sciweavers

42 search results - page 1 / 9
» The complexity of recognizing linear systems with certain in...
Sort
View
MP
2008
94views more  MP 2008»
13 years 4 months ago
The complexity of recognizing linear systems with certain integrality properties
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax 1, x 0 (1)...
Guoli Ding, Li Feng, Wenan Zang
DAM
2008
102views more  DAM 2008»
13 years 4 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
TIME
2003
IEEE
13 years 9 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 4 months ago
Convex Hull of Arithmetic Automata
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
Jérôme Leroux
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
13 years 10 months ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...