On (not) computing the Mobius function using bounded depth circuits
Any function F : {0,...,N-1} -> {-1,1} such that F(x) can be computed from the binary digits of x using a bounded depth circuit is orthogonal to the Mobius function mu in the sense that E_{0 <= x <= N-1} mu(x)F(x) = o(1). The proof combines a result of Linial, Mansour and Nisan...
Главный автор: | Green, B |
---|---|
Формат: | Journal article |
Опубликовано: |
2011
|
Схожие документы
Transposition Of Great Vessels And Mobius Syndrome
по: J Gordon Millichap
Опубликовано: (1988-12-01)
по: J Gordon Millichap
Опубликовано: (1988-12-01)
Схожие документы
-
Quadratic Uniformity of the Mobius Function
по: Green, B, и др.
Опубликовано: (2006) -
The Mobius function is strongly orthogonal to nilsequences
по: Green, B, и др.
Опубликовано: (2008) -
Compact Circuits for Efficient Möbius Transform
по: Subhadeep Banik, и др.
Опубликовано: (2024-03-01) -
Sharp bounds on partition dimension of hexagonal Möbius ladder
по: Muhammad Azeem, и др.
Опубликовано: (2022-02-01) -
On Möbius gyrogroup and Möbius gyrovector space
по: Kurosh Mavaddat Nezhaad, Ali Reza Ashrafi
Опубликовано: (2023-11-01)