99 search results - page 18 / 20 » Scott's problem for Proper Scott sets |
ECCC
2008
13 years 7 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
RTS
2002
13 years 7 months ago
2002
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
CHI
2009
ACM
14 years 8 months ago
2009
ACM
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
HPCA
2007
IEEE
14 years 7 months ago
2007
IEEE
Chip multiprocessors with multiple simpler cores are gaining popularity because they have the potential to drive future performance gains without exacerbating the problems of powe...
TPHOL
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract. Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory mode...