:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lahlou, Chams, Truffet, Laurent
Format:	Preprint
Published:	2021
Subjects:	Combinatorics 68Q15, 68Q25
Online Access:	https://arxiv.org/abs/2106.08854
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Looking for all solutions of the Max Atom Problem (MAP)
by: Truffet, Laurent
Published: (2024)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
by: Abdullah, Duaa, et al.
Published: (2025)

A non-iterative polynomial algorithm for linear programming
by: Jing-Yuan, Wei
Published: (2013)

Topological structure and a polynomial-time solution of linear programming over the real numbers
by: Wei, Jing-Yuan
Published: (2018)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
by: Cui, Jinchuan, et al.
Published: (2022)

On 3-colorability of (claw, diamond)-free graphs
by: Hodur, Nadzieja, et al.
Published: (2026)

Vanishing of Schubert Coefficients
by: Pak, Igor, et al.
Published: (2024)

Positivity of Schubert Coefficients
by: Pak, Igor, et al.
Published: (2024)

On the Low Weight Polynomial Multiple Problem
by: Ţiplea, Ferucio Laurenţiu, et al.
Published: (2024)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
by: Petrov, Petar P.
Published: (2022)

Closed-Form Decomposition for Simplicial Cones and PDBarv Algorithm for Lattice Point Counting
by: Tao, Sihao, et al.
Published: (2025)

Leakage-Resilient Hardness Equivalence to Logspace Derandomization
by: Shalunov, Yakov
Published: (2023)

Vanishing of Schubert coefficients in probabilistic polynomial time
by: Pak, Igor, et al.
Published: (2025)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
by: Tzameret, Iddo, et al.
Published: (2023)

Teaching and Learning under Deductive Errors
by: Telle, Jan Arne, et al.
Published: (2026)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)

On A. V. Anisimov's problem for finding a polynomial algorithm checking inclusion of context-free languages in group languages
by: Yordzhev, Krasimir
Published: (2026)

On Vanishing of Gromov--Witten Invariants
by: Pak, Igor, et al.
Published: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Polynomial Identity Testing via Evaluation of Rational Functions
by: Hu, Ivan, et al.
Published: (2022)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem
by: Ilmavirta, Joonas, et al.
Published: (2023)

The General Position Problem: A Survey
by: V., Ullas Chandran S., et al.
Published: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

Unifying lower bounds for algebraic machines, semantically
by: Seiller, Thomas, et al.
Published: (2018)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
by: Bergougnoux, Benjamin, et al.
Published: (2025)

Rational and algebraic series in combinatorial enumeration
by: Bousquet-Mélou, Mireille
Published: (2008)

The VC-dimension of a class of multiples of the primes, and a connection to AdaBoost
by: Thomas, Andrew M.
Published: (2022)

Tight complexity bounds for diagram commutativity verification
by: Malko, Artem, et al.
Published: (2025)

The number of primitive words of unbounded exponent in the language of an HD0L-system is finite
by: Klouda, Karel, et al.
Published: (2021)

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

Neural Network Approximation: A View from Polytope Decomposition
by: Li, ZeYu, et al.
Published: (2026)

Undefinability of Approximation of 2-to-2 Games
by: Dawar, Anuj, et al.
Published: (2025)

Certified Finite-State Induction for a Perturbed Hofstadter Recursion
by: Mantovanelli, Marco
Published: (2026)

The Separation of $NP$ and $PSPACE$
by: Lin, Tianrong
Published: (2021)

Vanishing of Schubert coefficients is in ${\sf AM}\cap {\sf coAM}$ assuming the GRH
by: Pak, Igor, et al.
Published: (2025)

Isomorphisms of graphs of Hyperbinary Expansions and Efficient Algorithms for Stern's Diatomic Sequence
by: De Paris, Alessandro
Published: (2024)

HaTT: Hadamard avoiding TT recompression
by: Sun, Zhonghao, et al.
Published: (2024)

Efficient Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Nonlinear Cellular Automata
by: Wang, Chen, et al.
Published: (2023)

On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains
by: Wright, Craig Steven
Published: (2025)