15033 search results - page 85 / 3007 » Complexity Theory and Algorithms |
139
click to vote
LICS
2002
IEEE
15 years 8 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
175
Voted
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
152
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
122
click to vote
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
131
Voted
WCE
2007
15 years 4 months ago
2007
—In this paper we used genetic algorithms to1 find the solution of game theory. We proposed new method foe solving game theory and find the optimal strategy for player A or playe...