4 search results - page 1 / 1 » Understanding the Mulmuley-Sohoni Approach to P vs. NP |
EATCS
2002
13 years 5 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
AIMS
2008
Springer
13 years 7 months ago
2008
Springer
In distributed, dynamic networks and applications, such as Peer-to-Peer (P2P), users'behaviour and quality of service/quality of experiment1 are known to influence each other....