10608 search results - page 281 / 2122 » Complexity of O'Hara's Algorithm |
101
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
90
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
125
Voted
ASP
2005
Springer
15 years 6 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
102
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...