Highly Influenced

# The network complexity and the Turing machine complexity of finite functions

@article{Schnorr1976TheNC, title={The network complexity and the Turing machine complexity of finite functions}, author={Claus-Peter Schnorr}, journal={Acta Informatica}, year={1976}, volume={7}, pages={95-107} }

- Published 1976 in Acta Informatica
DOI:10.1007/BF00265223

Let L(f) be the network complexity of a Boolean function L(f). For any n-ary Boolean function L(f) let $$TC(f) = min\{ T_p^{\bar A} (n){\text{ (}}\parallel p\parallel + 1gS_p^{\bar A} {\text{(}}n{\text{):}}res_p^{\bar A} {\text{(}}n{\text{) = }}f\} $$ . Hereby p ranges over all relative Turing programs and Ā ranges over all oracles such that given the oracle Ā, the restriction of p to inputs of length n is a program for L(f). ∥p∥ is the number of instructions of p. T p Ā (n) is the time bound… CONTINUE READING

Highly Cited

This paper has 64 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 65 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**65**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-6 of 6 references