699 search results - page 30 / 140 » The method of combinatorial telescoping |
109
click to vote
EVOW
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper we study the reconstruction of a network topology from the values of its betweenness centrality, a measure of the influence of each of its nodes in the diss...
114
Voted
DAM
2006
15 years 16 days ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
104
Voted
RSA
2006
15 years 12 days ago
2006
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...
125
Voted
CEC
2009
IEEE
14 years 10 months ago
2009
IEEE
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
95
Voted
AI
2003
Springer
15 years 5 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...