Sciweavers

235 search results - page 29 / 47
» Quantum certificate complexity
Sort
View
CHI
2004
ACM
14 years 9 months ago
Passwords you'll never forget, but can't recall
We identify a wide range of human memory phenomena as potential certificates of identity. These "imprinting" behaviors are characterized by vast capacity for complex exp...
Daphna Weinshall, Scott Kirkpatrick
ICSE
2007
IEEE-ACM
14 years 3 months ago
Languages for Safety-Critical Software: Issues and Assessment
Safety-critical systems (whose anomalous behavior could have catastrophic consequences such as loss of human life) are becoming increasingly prevalent; standards such as DO-178B, ...
Benjamin M. Brosgol
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 9 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
14 years 2 months ago
On the Complexity of Computing Units in a Number Field
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
Vikraman Arvind, Piyush P. Kurur
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 9 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha