Laced Boolean functions and subset sum problems in finite fields (Q2275906): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the subset sum problem over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CREW PRAM<scp>s</scp> and Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Fourier coefficients of the weighted sum function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restriction, terms and nonlinearity of Boolean functions / rank
 
Normal rank

Latest revision as of 08:52, 4 July 2024

scientific article
Language Label Description Also known as
English
Laced Boolean functions and subset sum problems in finite fields
scientific article

    Statements

    Laced Boolean functions and subset sum problems in finite fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2011
    0 references
    Boolean functions
    0 references
    Hamming weight
    0 references
    subset sum problems
    0 references
    residues modulo primes
    0 references

    Identifiers