Image de couverture de livre

Holonomic equations and efficient random generation of binary trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Lescanne, Pierre
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

DNF formulas are efficiently testable with relative error
par: Chen, Xi, et autres
Publié: (2026)

Semi-Streaming Algorithms for Graph Property Certification
par: Das, Avinandan, et autres
Publié: (2025)

Hardness of sampling for the anti-ferromagnetic Ising model on random graphs
par: Huang, Neng, et autres
Publié: (2024)

Fast decision tree learning solves hard coding-theoretic problems
par: Koch, Caleb, et autres
Publié: (2024)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
par: Dell, Holger, et autres
Publié: (2022)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
par: Kim, Eun Jung, et autres
Publié: (2022)

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
par: Esmer, Barış Can, et autres
Publié: (2022)

List Locally Surjective Homomorphisms in Hereditary Graph Classes
par: Dvořák, Pavel, et autres
Publié: (2022)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
par: Dumas, Maël, et autres
Publié: (2022)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

A tight quasi-polynomial bound for Global Label Min-Cut
par: Jaffke, Lars, et autres
Publié: (2022)

Asymmetric Number Partitioning with Splitting and Interval Targets
par: Bismuth, Samuel, et autres
Publié: (2022)

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results
par: Focke, Jacob, et autres
Publié: (2022)

Neighborhood-Aware Graph Labeling Problem
par: Shahverdikondori, Mohammad, et autres
Publié: (2026)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
par: Greilhuber, Jakob, et autres
Publié: (2025)

Lazy Kronecker Product
par: Song, Zhao
Publié: (2026)

The Trichotomy of Regular Property Testing
par: Bathie, Gabriel, et autres
Publié: (2025)

Complexity of Local Search for Euclidean Clustering Problems
par: Manthey, Bodo, et autres
Publié: (2023)

Can You Link Up With Treewidth?
par: Curticapean, Radu, et autres
Publié: (2024)

Downward self-reducibility in the total function polynomial hierarchy
par: Gajulapalli, Karthik, et autres
Publié: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
par: Fujie, Yuto, et autres
Publié: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
par: Moroie, Gregory
Publié: (2025)

Precoloring extension with demands on paths
par: Das, Arun Kumar, et autres
Publié: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
par: Gholizadeh, Hossein, et autres
Publié: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
par: Herrmann, Anton, et autres
Publié: (2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
par: Assadi, Sepehr, et autres
Publié: (2025)

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth
par: Maalouly, Nicolas El, et autres
Publié: (2025)

k-SUM Hardness Implies Treewidth-SETH
par: Lampis, Michael
Publié: (2025)

Efficient Catalytic Graph Algorithms
par: Cook, James, et autres
Publié: (2025)

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
par: Enright, Jessica, et autres
Publié: (2020)

Minimizing Envy and Maximizing Happiness in Graphical House Allocation
par: Dhar, Anubhav, et autres
Publié: (2025)

An Invitation to "Fine-grained Complexity of NP-Complete Problems"
par: Nederlof, Jesper
Publié: (2026)

Scheduling Problems with Constrained Rejections
par: Davies, Sami, et autres
Publié: (2025)

Graded Projection Recursion (GPR): Corrections, Obstructions, and Conservative Approximate Matrix Multiplication
par: Uhlmann, Jeffrey
Publié: (2025)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Parameterized Complexity of Vehicle Routing
par: Döring, Michelle, et autres
Publié: (2025)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
par: Ducoffe, Guillaume
Publié: (2026)

Automated Lower Bounds for Small Matrix Multiplication Complexity over Finite Fields
par: Wang, Chengu
Publié: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
par: Asadi, Vahid R., et autres
Publié: (2026)