SAT
2007
Springer
13 years 11 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.
ESA
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
ACISP
2007
Springer
13 years 11 months ago
2007
Springer
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
ICCV
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
HICSS
2008
IEEE
13 years 11 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
UC
2009
Springer
13 years 11 months ago
2009
Springer
Membrane systems with dividing and dissolving membranes are known to solve PSPACE problems in polynomial time. However, we give a P upperbound on an important restriction of such s...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...