Sciweavers

1028 search results - page 104 / 206
» Character sets of strings
Sort
View
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
14 years 18 days ago
The Instance Complexity Conjecture
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
Martin Kummer
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 9 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
14 years 3 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
CORR
2007
Springer
103views Education» more  CORR 2007»
13 years 9 months ago
Physical limits of inference
We show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. We call devices with that structure “inference de...
David H. Wolpert