Gallery of Computation. LIVING WORKS binary.ring bit.10001 bone.piles box.fitting box.fitting.img new bubble.chamber buddhabrot city.traveler cubic.attractor deep.lorenz guts new happy.place new henon.phase henon.phase.deep new inter.aggregate new inter.momentary new invader.fractal limb.sand.stroke limb.strat limb.stroke mcp moonlight.soyuz nine.block node.garden new offspring orbitals new paths.i peter.de.jong sand.dollar sand.stroke sand.traveler new self-dividing.line stitches substrate new tree.garden.ii trema.disk trema.spike INFORMATION about the programmer about the medium ORDERING works available production qualities ordering policies CONTACT j.tarbell @ complexification.net.
Computer and Information Science Papers CiteSeer Publications Re. Computational complexity theory - Wikipedia, the free encycloped. Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
A computational problem is understood to be a task that is in principle amenable to being solved by a computer, which is equivalent to stating that the problem may be solved by mechanical application of mathematical steps, such as an algorithm. A problem is regarded as inherently difficult if its solution requires significant resources, whatever the algorithm used.