Towards a theory of local and global in computation

DOI10.1016/0304-3975(78)90004-XzbMath0368.68052OpenAlexW2024285901MaRDI QIDQ1242680

Harold Abelson

Publication date: 1978

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(78)90004-x

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

On the representation of multi-input systems: Computational properties of polynomial algorithms ⋮ Compositional complexity of Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Analog perceptron: Its decomposition and order
• On the representation of continuous functions of several variables by superpositions of continuous functions of a smaller number of variables
• Analog perceptrons: On additive representation of functions
• A note on the interrelation of subsets of independent variables of a continuous function with continuous first derivatives

This page was built for publication: Towards a theory of local and global in computation