date: 2024-11-20T10:20:39Z
pdf:PDFVersion: 1.7
pdf:docinfo:title: On the Communication Complexity of Approximate Pattern Matching
xmp:CreatorTool: LaTeX with acmart 2024/02/04 v2.03 Typesetting articles for the Association for Computing Machinery and hyperref 2024-01-20 v7.01h Hypertext links for LaTeX; Conference Publishing Consulting
access_permission:can_print_degraded: true
subject: -  Theory of computation  ->  Design and analysis of algorithms.Communication complexity.Pattern matching.Quantum complexity theory.; STOC 2024
dc:format: application/pdf; version=1.7
pdf:docinfo:creator_tool: LaTeX with acmart 2024/02/04 v2.03 Typesetting articles for the Association for Computing Machinery and hyperref 2024-01-20 v7.01h Hypertext links for LaTeX; Conference Publishing Consulting
access_permission:fill_in_form: true
pdf:encrypted: false
dc:title: On the Communication Complexity of Approximate Pattern Matching
modified: 2024-11-20T10:20:39Z
cp:subject: -  Theory of computation  ->  Design and analysis of algorithms.Communication complexity.Pattern matching.Quantum complexity theory.; STOC 2024
pdf:docinfo:subject: -  Theory of computation  ->  Design and analysis of algorithms.Communication complexity.Pattern matching.Quantum complexity theory.; STOC 2024
pdf:docinfo:creator: Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz
PTEX.Fullbanner: This is pdfTeX, Version 3.141592653-2.6-1.40.26 (TeX Live 2024/Homebrew) kpathsea version 6.4.0
meta:author: Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz
meta:creation-date: 2024-04-17T12:29:36Z
created: 2024-04-17T12:29:36Z
access_permission:extract_for_accessibility: true
Creation-Date: 2024-04-17T12:29:36Z
Author: Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz
producer: pdfTeX, Version 3.141592653-2.6-1.40.26 (TeX Live 2024/Homebrew) kpathsea version 6.4.0; ConfPub - stoc24main-p13-p rev-a15f4fcaf7-77162 p1758 on 2024-06-06T22:31:27+02:00; modified using iText 4.2.0 by 1T3XT
pdf:docinfo:producer: pdfTeX, Version 3.141592653-2.6-1.40.26 (TeX Live 2024/Homebrew) kpathsea version 6.4.0; ConfPub - stoc24main-p13-p rev-a15f4fcaf7-77162 p1758 on 2024-06-06T22:31:27+02:00; modified using iText 4.2.0 by 1T3XT
pdf:unmappedUnicodeCharsPerPage: 123
Keywords: Pattern Matching with Edits; Communication Complexity; Quantum Algorithms
access_permission:modify_annotations: true
dc:creator: Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz
dcterms:created: 2024-04-17T12:29:36Z
Last-Modified: 2024-11-20T10:20:39Z
dcterms:modified: 2024-11-20T10:20:39Z
title: On the Communication Complexity of Approximate Pattern Matching
Last-Save-Date: 2024-11-20T10:20:39Z
pdf:docinfo:keywords: Pattern Matching with Edits; Communication Complexity; Quantum Algorithms
pdf:docinfo:modified: 2024-11-20T10:20:39Z
meta:save-date: 2024-11-20T10:20:39Z
pdf:docinfo:custom:PTEX.Fullbanner: This is pdfTeX, Version 3.141592653-2.6-1.40.26 (TeX Live 2024/Homebrew) kpathsea version 6.4.0
Content-Type: application/pdf
X-Parsed-By: org.apache.tika.parser.DefaultParser
creator: Tomasz Kociumaka, Jakob Nogler, and Philip Wellnitz
dc:subject: Pattern Matching with Edits; Communication Complexity; Quantum Algorithms
access_permission:assemble_document: true
xmpTPg:NPages: 11
pdf:charsPerPage: 4250
access_permission:extract_content: true
access_permission:can_print: true
meta:keyword: Pattern Matching with Edits; Communication Complexity; Quantum Algorithms
access_permission:can_modify: true
pdf:docinfo:created: 2024-04-17T12:29:36Z