269 search results - page 11 / 54 » Complexity Theory Made Easy |
235
Voted
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
241
click to vote
POPL
2003
ACM
16 years 4 months ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
149
Voted
PODC
2006
ACM
15 years 10 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
137
click to vote
AI
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
128
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...