String Matching: Communication, Circuits, and Learning. (Q5875515): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4431347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold circuits of bounded depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2810825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Top-down lower bounds for depth-three circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean function complexity. Advances and frontiers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Communication Complexity of Set Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning visual concepts and DNF formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural circuits for pattern recognition with small total wire length. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation with threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Pattern Matching in the Streaming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small depth threshold circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Worst-Case Behavior of String-Searching Algorithms / rank
 
Normal rank

Revision as of 10:51, 31 July 2024

scientific article; zbMATH DE number 7650123
Language Label Description Also known as
English
String Matching: Communication, Circuits, and Learning.
scientific article; zbMATH DE number 7650123

    Statements

    0 references
    0 references
    0 references
    0 references
    3 February 2023
    0 references
    string matching
    0 references
    communication complexity
    0 references
    circuit complexity
    0 references
    PAC learning
    0 references
    String Matching: Communication, Circuits, and Learning. (English)
    0 references

    Identifiers