2446 search results - page 91 / 490 » Choiceless Polynomial Time |
181
click to vote
LICS
2005
IEEE
15 years 12 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
178
click to vote
QOSIP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
150
click to vote
AISC
2004
Springer
15 years 11 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
150
click to vote
GC
2004
Springer
15 years 11 months ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
156
click to vote
PKC
2004
Springer
15 years 11 months ago
2004
Springer
Boneh and Venkatesan have proposed a polynomial time algorithm in a non-uniform model for recovering a ”hidden” element α ∈ IFp, where p is prime, from very short strings of...