The four corners problem over larger alphabets

DOI10.1007/978-3-032-28404-4_22MaRDI QIDQ7356310zbMATH OpenFDO

Authors Daniel Průša, Michael Wehar, Chen Xu

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
• An improved construction of progression-free sets
• Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices
• Finding and counting given length cycles
• Finding four-node subgraphs in triangle time
• Finding squares and rectangles in sets of points
• Fine-Grained Complexity Theory (Tutorial)
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
• scientific article; zbMATH DE number 5968943 (Why is no real title available?)
• scientific article; zbMATH DE number 3340123 (Why is no real title available?)
• On the complexity of fixed parameter clique and dominating set
• On the irreversibility of Moore cellular automata over the ternary field and image application
• Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
• Two-dimensional pattern matching against local and regular-like picture languages

This page was built for publication: The four corners problem over larger alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356310)