884 search results - page 25 / 177 » Control structures in programs and computational complexity |
ICALP
2003
Springer
14 years 25 days ago
2003
Springer
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
ITICSE
2004
ACM
14 years 1 months ago
2004
ACM
Prior research on pair programming has found that compared to students who work alone, students who pair have shown increased confidence in their work, greater success in CS1, an...
EM
2010
13 years 7 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
ICALP
2003
Springer
14 years 25 days ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...