2446 search results - page 340 / 490 » Choiceless Polynomial Time |
SPIRE
1999
Springer
14 years 4 days ago
1999
Springer
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
ICCS
1998
Springer
14 years 3 days ago
1998
Springer
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
SACRYPT
1998
Springer
14 years 3 days ago
1998
Springer
In 1998, Cai and Cusick proposed a lattice-based public-key cryptosystem based on the similar ideas of the Ajtai-Dwork cryptosystem, but with much less data expansion. However, th...
SAC
1997
ACM
14 years 2 days ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
ICLP
1997
Springer
14 years 1 days ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...