Towards a theory of local and global in computation

DOI10.1016/0304-3975(78)90004-XzbMATH Open0368.68052OpenAlexW2024285901MaRDI QIDQ1242680FDOQ1242680

Authors: 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)

Cites Work

• Title not available (Why is that?)
• On the representation of continuous functions of several variables by superpositions of continuous functions of a smaller number of variables
• A note on the interrelation of subsets of independent variables of a continuous function with continuous first derivatives
• Analog perceptron: Its decomposition and order
• Analog perceptrons: On additive representation of functions
• Title not available (Why is that?)

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1242680)