740 search results - page 87 / 148 » Lower bounds for Buchsbaum* complexes |
160
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
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...
168
click to vote
FOSSACS
2007
Springer
16 years 10 days ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
155
click to vote
WAOA
2004
Springer
15 years 11 months ago
2004
Springer
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
137
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
139
click to vote
TIT
2008
15 years 6 months ago
2008
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...