504 search results - page 50 / 101 » The Complexity of Symmetry-Breaking Formulas |
158
click to vote
ASIACRYPT
2005
Springer
15 years 10 months ago
2005
Springer
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
122
click to vote
ISCIS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
154
click to vote
AMAI
2004
Springer
15 years 10 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...
120
click to vote
CONCUR
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...
152
click to vote
RSCTC
2004
Springer
15 years 10 months ago
2004
Springer
We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, int...