Sciweavers

Share
61 search results - page 1 / 13
» Towards a Solution to the "Runs" Conjecture
Sort
View
CPM
2008
Springer
107views Combinatorics» more  CPM 2008»
8 years 5 months ago
Towards a Solution to the "Runs" Conjecture
Maxime Crochemore, Lucian Ilie, Liviu Tinta
ASIACRYPT
2004
Springer
8 years 8 months ago
The XL-Algorithm and a Conjecture from Commutative Algebra
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
Claus Diem
BMCBI
2006
100views more  BMCBI 2006»
8 years 3 months ago
Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
Kang Ning, Hon Wai Leong
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
9 years 3 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
9 years 19 days ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
books