13603 search results - page 133 / 2721 » On the Computational Complexity of Cut-Reduction |
157
click to vote
IWANN
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. A new algorithm is presented for finding genotype-phenotype association rules from data related to complex diseases. The algorithm was based on Genetic Algorithms, a tech...
291
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
142
Voted
ASIACRYPT
2005
Springer
15 years 11 months ago
2005
Springer
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...
146
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
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...
144
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
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...