Laced Boolean functions and subset sum problems in finite fields
From MaRDI portal
Publication:2275906
DOI10.1016/J.DAM.2011.03.022zbMATH Open1247.06010OpenAlexW1978814406MaRDI QIDQ2275906FDOQ2275906
Authors: David Canright, Sugata Gangopadhyay, Subhamoy Maitra, Pantelimon Stanica 
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
Recommendations
- On the subset sum problem over finite fields
- On the subset sum problem for finite fields
- The \(k\)-subset sum problem over finite fields
- scientific article; zbMATH DE number 3781244
- Lattices in finite fields
- Complexity of Boolean schemes for arithmetic in some towers of finite fields
- Boolean algebras of lattice uniformities and decompositions of modular functions
- A conjecture about polynomial time computable lattice-lattice functions
- Boolean algebras and Lubell functions
- scientific article; zbMATH DE number 176868
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Restriction, terms and nonlinearity of Boolean functions
- On the subset sum problem over finite fields
- Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
- CREW PRAM<scp>s</scp> and Decision Trees
- Bounds on the Fourier coefficients of the weighted sum function
- A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
Cited In (4)
This page was built for publication: Laced Boolean functions and subset sum problems in finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275906)
