44 search results - page 1 / 9 » Boolean Functions, Invariance Groups and Parallel Complexity |
COCO
1989
Springer
13 years 11 months ago
1989
Springer
COCO
2004
Springer
14 years 22 days ago
2004
Springer
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
COCO
2005
Springer
14 years 27 days ago
2005
Springer
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
ACISP
1999
Springer
13 years 11 months ago
1999
Springer
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a boolean function limits the size of the function’s cl...
DFG
1992
Springer
13 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...