Sciweavers

612 search results - page 25 / 123
» Hardness assumptions in the foundations of theoretical compu...
Sort
View
ITICSE
2004
ACM
14 years 1 months ago
An assistive technology project for an HCI course
This presentation describes a project for a standard undergraduate human-computer interaction (HCI) course that incorporates issues related to users who are disabled. It is part o...
Blaise W. Liffick
MFCS
2004
Springer
14 years 1 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&...
TCS
2010
13 years 2 months ago
Bounds on the efficiency of black-box commitment schemes
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
Omer Horvitz, Jonathan Katz
TCC
2004
Springer
147views Cryptology» more  TCC 2004»
14 years 1 months ago
Computational Collapse of Quantum State with Application to Oblivious Transfer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...
Claude Crépeau, Paul Dumais, Dominic Mayers...
SOFSEM
1999
Springer
13 years 12 months ago
Software Change and Evolution
Changeability (also called evolvability) is an essential property of software. Software change is the foundation for both new software development and legacy software maintenance, ...
Vaclav Rajlich