Sciweavers

158 search results - page 4 / 32
» Some counting problems related to permutation groups
Sort
View
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 2 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
Krishnam Raju Jampani, Anna Lubiw
LICS
2000
IEEE
13 years 12 months ago
Computational Complexity of Some Problems Involving Congruences on Algebras
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
Clifford Bergman, Giora Slutzki
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
14 years 23 days ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
IPMI
2003
Springer
14 years 8 months ago
Permutation Tests for Classification: Towards Statistical Significance in Image-Based Studies
Abstract. Estimating statistical significance of detected differences between two groups of medical scans is a challenging problem due to the high dimensionality of the data and th...
Polina Golland, Bruce Fischl
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 7 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella