Keyphrases
Expected Running Time
66%
Subtree Isomorphism
66%
Subquadratic Algorithms
66%
Fast Algorithm
66%
Language Model
66%
Tight
63%
Number of Edges
50%
Word RAM Model
50%
Ksat
50%
Strong Exponential Time Hypothesis
44%
Queue Management
41%
Large Language Models
38%
Conditional Lower Bounds
33%
Adversary
33%
Communication Protocol
33%
Connected Component
33%
Incident Edges
33%
Disk Robot
33%
SAT Algorithms
33%
Referee
33%
Edge Weight
33%
Ordered Set
33%
Sorted Matrices
33%
One-way Communication
33%
Total Path Length
33%
Unit Disk
33%
Bottleneck Paths
33%
Spanning Forest
33%
3-SAT
33%
Graphical Games
33%
Jensen's Inequality
33%
Motion Planning
33%
Optimality Guarantee
33%
Path Planning
33%
Total Complexity
33%
Workspace
33%
Amortized Cost
33%
Sorted List
33%
Polygonal Obstacles
33%
Expected number
33%
CSP Problem
33%
Simple Graph
33%
X + Y
33%
Cycle Removal
33%
Approximate Query
33%
Single-linkage Clustering
33%
Non-adaptive
33%
Cell Probe
33%
Hashing
33%
Dictionary
33%
Mathematics
Edge
100%
Running Time
88%
Worst Case
75%
Exponential Time
66%
Fast Algorithm
66%
Upper Bound
63%
Approximates
44%
Model Comparison
44%
Constant Factor
36%
Optimality
35%
Matrix (Mathematics)
33%
Jensen Inequality
33%
Dimensionality Reduction
33%
Hypergraphs
33%
Chaudhuri
33%
Ordered Set
33%
Probability Theory
33%
Chromatic Number
33%
Complexity Space
33%
Conditionals
33%
Linear Time
33%
Triangle
33%
Hypercube
33%
Motion Planning
33%
Response Model
33%
Total Number
25%
Minimum Spanning Tree
22%
Spanning Tree
22%
Total Length
16%
Unit Disk
16%
Minimizes
16%
Path Length
16%
Maximum Degree
16%
Graph Coloring
16%
Random Input
16%
Incident Edge
16%
Lower and upper bounds
16%
Orthogonal Vector
16%
Decision Tree
16%
Extremal Combinatorics
16%
Simple Graph
16%
Binary Tree
16%
Branching Programs
16%
Open Question
16%
Codimension
16%
Linear Subspace
16%
Connected Component
16%
Random Variable
16%
Median
11%
Hierarchical Clustering
11%
Computer Science
Data Structure
66%
Language Modeling
66%
Large Language Model
50%
Subgraphs
33%
Spanning Tree
33%
Constraint Satisfaction Problems
33%
Orthogonal Vector
33%
Dimensionality Reduction
33%
Motion Planning
33%
Robot
33%
Backdoors
33%
Fast Algorithm
33%
Satisfying Assignment
33%
Space Complexity
33%
Hashing
33%
Fundamental Importance
33%
Binary Tree
33%
Decision Tree
33%
Steganography
33%
Learning System
33%
Machine Learning
33%
Constant Factor
27%
Experimental Result
27%
Approximation (Algorithm)
22%
Minimum Spanning Tree
22%
path-planning
16%
Communication Protocol
16%
Success Probability
16%
Randomized Algorithm
16%
Connected Component
16%
Directed Graphs
16%
watermark embedding
16%
Artificial Intelligence
16%
Generative Pre-Trained Transformer 4
16%
Location Problem
11%
Speed-up
11%
Word Length
11%
approximation factor
11%
Dimensional Problem
11%
Dimensional Subspace
11%
Intrinsic Dimensionality
11%
Deterministic Bound
11%
Static Partitioning
11%
Identical Operation
11%
Hash Function
11%
Inherent Complexity
11%
Hierarchical Clustering
11%
Watermarking Scheme
8%
Training Data
5%
Adversarial Example
5%
