6142 search results - page 881 / 1229 » The Complexity of Partition Functions |
180
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
182
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
183
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
179
click to vote
SIGDOC
2009
ACM
16 years 1 months ago
2009
ACM
Texts are the media content primarily available on Web sites and applications. However, this heavy use of texts creates an accessibility barrier to those who cannot read fluently...
179
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...