Sciweavers

23 search results - page 4 / 5
» Symmetric Subgroup Membership Problems
Sort
View
STACS
2007
Springer
14 years 1 months ago
Symmetries and the Complexity of Pure Nash Equilibrium
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
Felix Brandt, Felix A. Fischer, Markus Holzer
ICICS
2005
Springer
14 years 25 days ago
Secure Multicast Using Proxy Encryption
In a secure multicast communication environment, only valid members belong to the multicast group could decrypt the data. In many previous researches, there is one “group key” ...
Yun-Peng Chiu, Chin-Laung Lei, Chun-Ying Huang
IJAC
2002
128views more  IJAC 2002»
13 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
FSTTCS
2004
Springer
14 years 21 days ago
Testing Geometric Convexity
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
Luis Rademacher, Santosh Vempala
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile