Learning Read-Constant Polynomials of Constant Degree Modulo Composites (Q3007614): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W133418326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Learning Read-k-Satisfy-j DNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning read-once formulas with queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing Boolean functions as polynomials modulo composite numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear lower bounds for bounded-width branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-uniform automata over groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning functions represented as multiplicity automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of certain exponential sums arising in complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Regular Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning matrix functions over rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-query locally decodable codes of subexponential length / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Perspective on Boolean Function Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for group products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning sparse multivariate polynomials over a field with queries and counterexamples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the MOD 6 degree of the OR function / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:49, 4 July 2024

scientific article
Language Label Description Also known as
English
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
scientific article

    Statements

    Learning Read-Constant Polynomials of Constant Degree Modulo Composites (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    0 references
    0 references