Sciweavers

1243 search results - page 63 / 249
» Complexity reduction of C-Algorithm
Sort
View
EUROCRYPT
2000
Springer
15 years 5 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
RSCTC
2000
Springer
139views Fuzzy Logic» more  RSCTC 2000»
15 years 4 months ago
Application of Normalized Decision Measures to the New Case Classification
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...
Dominik Slezak, Jakub Wroblewski
COCO
1995
Springer
83views Algorithms» more  COCO 1995»
15 years 4 months 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
MFCS
2004
Springer
15 years 6 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
CAE
2007
15 years 3 months ago
Conceptualizing Birkhoff's Aesthetic Measure Using Shannon Entropy and Kolmogorov Complexity
In 1928, George D. Birkhoff introduced the Aesthetic Measure, defined as the ratio between order and complexity, and, in 1965, Max Bense analyzed Birkhoff's measure from an i...
Jaume Rigau, Miquel Feixas, Mateu Sbert