Laced Boolean functions and subset sum problems in finite fields
From MaRDI portal
Publication:2275906
DOI10.1016/j.dam.2011.03.022zbMath1247.06010OpenAlexW1978814406MaRDI QIDQ2275906
David Canright, Subhamoy Maitra, Sugata Gangopadhyay, Pantelimon Stănică
Publication date: 10 August 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.03.022
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
On the average sensitivity of the weighted sum function ⋮ The simplified weighted sum function and its average sensitivity
Cites Work
- Unnamed Item
- Unnamed Item
- On the subset sum problem over finite fields
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
- Restriction, terms and nonlinearity of Boolean functions
- Bounds on the Fourier coefficients of the weighted sum function
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- CREW PRAM<scp>s</scp> and Decision Trees
This page was built for publication: Laced Boolean functions and subset sum problems in finite fields
