Sciweavers

248 search results - page 38 / 50
» On the Cayley isomorphism problem
Sort
View
EUROCRYPT
2008
Springer
13 years 11 months ago
Key Recovery on Hidden Monomial Multivariate Schemes
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
Pierre-Alain Fouque, Gilles Macario-Rat, Jacques S...
FOCS
2007
IEEE
14 years 4 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
GD
2005
Springer
14 years 3 months ago
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
Michael T. Goodrich, George S. Lueker, Jonathan Z....
JACM
2007
160views more  JACM 2007»
13 years 9 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 15 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...