8196 search results - page 93 / 1640 » Computational Modeling and Complexity Science |
JOC
2000
14 years 9 months ago
2000
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper studies a recently developed an approach to reasoning about mutable data structures, which uses an assertion language with spatial conjunction and implication ...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
SUTC
2006
IEEE
15 years 3 months ago
2006
IEEE
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
IANDC
2010
14 years 8 months ago
2010
We show that the two NP-complete problems of Dodgson Score and Young Score have differing computational complexities when the winner is close to being a Condorcet winner. On the ...