2446 search results - page 160 / 490 » Choiceless Polynomial Time |
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We study the learning models defined in [AKST97]: Learning with equivalence and limited membership queries and learning with equivalence and malicious membership queries. We show ...
128
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
127
Voted
IJCAI
1993
15 years 2 months ago
1993
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
93
Voted
SOCO
2002
Springer
15 years 22 days ago
2002
Springer
In this article, we develop a new method and an algorithm to solve a system of fuzzy relation equations. We first introduce a solution-base-matrix and then give a tractable mathema...
145
Voted
TCBB
2011
14 years 8 months ago
2011
Galled trees, directed acyclic graphs that model evolutionary histories with isolated hybridization events, have become very popular due to both their biological significance and ...