Sciweavers

16666 search results - page 79 / 3334
» Descriptive and Computational Complexity
Sort
View
113
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
Martin Hirt, Jesper Buus Nielsen
ANTS
2004
Springer
109views Algorithms» more  ANTS 2004»
15 years 9 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
CSCWD
2008
Springer
15 years 5 months ago
Computer aided architectural design: Wayfinding complexity analysis
Design is a complex process often described as a collaboration between a designer and herself. In architectural design, a designer must consider the selection of a subset of actio...
Brett Bojduj, Ben Weber, Kai-Florian Richter, Sven...
118
Voted
CORR
1998
Springer
135views Education» more  CORR 1998»
15 years 3 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
118
Voted
CHI
2007
ACM
16 years 4 months ago
Computer aided observations of complex mobile situations
Designing mobile and wearable applications is a challenge. The context of use is more important than ever and traditional methodologies for elicitation and specification reach the...
Tobias Klug