Towards a Theory of Local and Global in Computation
We formulate the rudiments of a method for assessing the difficulty of dividing a computational problem into "independent simpler parts." This work illustrates measures of complexity which attempt to capture the distinction between "local" and "global" computation...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/5743 |