Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Abstract. We review the use of diagrams in the UK National School Curriculum (NC) and assess it in the light of current research on childrens' graph comprehension. It is noted...
The purpose of this panel is to report on a structured demonstration for comparing program comprehension tools. Five program comprehension tool designers applied their tools to a ...
Susan Elliott Sim, Margaret-Anne D. Storey, Andrea...