On a hierarchy of Boolean functions hard to compute in constant depth
Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation.\par This work represents a step in this direction: we d...
| Հիմնական հեղինակ: | |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
| Շարք: | Discrete Mathematics & Theoretical Computer Science |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://dmtcs.episciences.org/283/pdf |