Polynomial-time quantum algorithms for finding the linear structures of Boolean function (Q2347659): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Linear symmetries of Boolean functions. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484887 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4359590 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Characterization of linear structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of realization of a linear Boolean function in Sheffer's basis / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3994535 / rank | |||
Normal rank |
Latest revision as of 05:11, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial-time quantum algorithms for finding the linear structures of Boolean function |
scientific article |
Statements
Polynomial-time quantum algorithms for finding the linear structures of Boolean function (English)
0 references
5 June 2015
0 references
quantum algorithm
0 references
Boolean function
0 references
linear structure
0 references
quantum decoder
0 references