Skip to main content
Log in

On modp transversals

  • Published:
Combinatorica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. D. Barrington: Bounded-width polynomial-size branching programs recognize exactly those languages in NC,Proc. 18 th ACM STOC,1986.

  2. R. Boppana, andM. Sipser: The complexity of finite function, preprint.

  3. A. A. Razborov: Lower bounds on the size of bounded depth networks over a complete basis with logical addition,Matematischi Zametki 41:4, 598–607 (in Russian). English translation inMathematical Notes of the Academy of Sciences of the USSR 41:4, 333–338.

  4. K. T. Smith: The uncertainty principle on groups,IMA Preprint Series # 402, 1988.

  5. R. Smolensky: Algebraic methods in the theory of lower bounds for Boolean circuit complexity,Proc. 19 th ACM STOC,1987.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by AFOSR 0271. First author supported by NSF and a Sloan Research Fellowship.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kahn, J., Meshulam, R. On modp transversals. Combinatorica 11, 17–22 (1991). https://doi.org/10.1007/BF01375469

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01375469

AMS subject classification (1980)

Navigation