11345 search results - page 1983 / 2269 » Foundations of Computer Science |
131
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
127
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
124
Voted
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
125
click to vote
CSEE
2009
Springer
15 years 10 months ago
2009
Springer
This paper reports on results from a pilot study that used Bloom’s Taxonomy to observe cognition levels during software inspections conducted by undergraduate computer science a...
123
Voted
CSEE
2009
Springer
15 years 10 months ago
2009
Springer
As software engineering educators, it is important for us to realize the increasing domainspecificity of software, and incorporate these changes in our design of teaching material...