2412 search results - page 202 / 483 » Which Problems Have Strongly Exponential Complexity |
108
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...
153
Voted
INFORMATICALT
2006
15 years 3 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
129
click to vote
CRYPTO
1994
Springer
15 years 7 months ago
1994
Springer
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
117
Voted
MP
2006
15 years 3 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
155
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
This paper presents a method for visual object categorization based on encoding the joint textural information in objects and the surrounding background, and requiring no segmenta...