1225 search results - page 41 / 245 » The Instance Complexity Conjecture |
112
click to vote
FSTTCS
2003
Springer
15 years 8 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
119
Voted
IJFCS
2006
15 years 2 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
115
Voted
CANDC
2000
ACM
15 years 2 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
127
Voted
LATA
2012
Springer
13 years 10 months ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
131
Voted
IJAC
2006
15 years 2 months ago
2006
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...