Sciweavers

8 search results - page 2 / 2
» stoc 1989
Sort
View
STOC
1989
ACM
96views Algorithms» more  STOC 1989»
13 years 9 months ago
Optimal Size Integer Division Circuits
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division  nding reciprocals that...
John H. Reif, Stephen R. Tate
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 9 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 9 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang