Image de couverture de livre

Reinforced Generation of Combinatorial Structures: Ramsey Numbers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Nagda, Ansh, Raghavan, Prabhakar, Thakurta, Abhradeep
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Artificial Intelligence Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
par: Nagda, Ansh, et autres
Publié: (2025)

On optimal distinguishers for Planted Clique
par: Nagda, Ansh, et autres
Publié: (2025)

The Rank-Ramsey Problem and the Log-Rank Conjecture
par: Beniamini, Gal, et autres
Publié: (2024)

On the Structure of Hamiltonian Graphs with Small Independence Number
par: Jedličková, Nikola, et autres
Publié: (2024)

Reasonable Bounds for Combinatorial Lines of Length Three
par: Bhangale, Amey, et autres
Publié: (2024)

Combinatorial refinement on circulant graphs
par: Kluge, Laurence
Publié: (2022)

On approximability of the Permanent of PSD matrices
par: Ebrahimnejad, Farzam, et autres
Publié: (2024)

The Parameterized Complexity of Computing the VC-Dimension
par: Foucaud, Florent, et autres
Publié: (2025)

SAT Requires Exhaustive Search
par: Xu, Ke, et autres
Publié: (2023)

Finding hardness reductions automatically using SAT solvers
par: Bergold, Helena, et autres
Publié: (2024)

Finding a HIST: Chordality, Structural Parameters, and Diameter
par: Hanaka, Tesshu, et autres
Publié: (2025)

Lions and Contamination: Trees and General Graphs
par: Kim, Dohoon, et autres
Publié: (2026)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
par: Minevich, Igor, et autres
Publié: (2024)

Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
par: Dvijotham, Krishnamurthy, et autres
Publié: (2024)

On the Complexity of Identification in Linear Structural Causal Models
par: Dörfler, Julian, et autres
Publié: (2024)

Structure-Aware Encodings of Argumentation Properties for Clique-width
par: Mahmood, Yasir, et autres
Publié: (2025)

A Structural Complexity Analysis of Hierarchical Task Network Planning
par: Brand, Cornelius, et autres
Publié: (2024)

Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
par: Fioravantes, Foivos, et autres
Publié: (2024)

Probabilistic Generating Circuits -- Demystified
par: Agarwal, Sanyam, et autres
Publié: (2024)

Structural Origins of Cubic Complexity in Pebble Motion
par: Nakamigawa, Tomoki, et autres
Publié: (2025)

Universal NP-Hardness of Clustering under General Utilities
par: Majumdar, Angshul
Publié: (2026)

A Note on the Complexity of Directed Clique
par: Gutowski, Grzegorz, et autres
Publié: (2026)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
par: Grüne, Christoph, et autres
Publié: (2026)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
par: Han, Zicheng, et autres
Publié: (2026)

Classification of Non-redundancy of Boolean Predicates of Arity 4
par: Brakensiek, Joshua, et autres
Publié: (2026)

King Chasing Problem in Chinese Chess is NP-hard
par: Li, Chao, et autres
Publié: (2026)

Between proper and square coloring of planar graphs, hardness and extremal graphs
par: Delépine, Thomas
Publié: (2026)

The Lens of Abelian Embeddings
par: Minzer, Dor
Publié: (2026)

Communication Complexity of Disjointness under Product Distributions
par: Hunter, Zach, et autres
Publié: (2026)

Low-Degree Polynomials Are Good Extractors
par: Alrabiah, Omar, et autres
Publié: (2024)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2025)

Refuting Perfect Matchings in Spectral Expanders is Hard
par: Biswas, Ari, et autres
Publié: (2025)

Direct Product Primality Testing of Graphs is GI-hard
par: Calderoni, Luca, et autres
Publié: (2020)

Monotone Circuit Complexity of Matching
par: Cavalar, Bruno, et autres
Publié: (2025)

Hunting a rabbit: complexity, approximability and some characterizations
par: Ben-Ameur, Walid, et autres
Publié: (2025)

On the Keevash-Knox-Mycroft Conjecture
par: Gan, Luyining, et autres
Publié: (2022)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
par: Borzechowski, Michaela, et autres
Publié: (2023)

Sparse juntas on the biased hypercube
par: Dinur, Irit, et autres
Publié: (2017)

Improved Lower Bounds for all Odd-Query Locally Decodable Codes
par: Basu, Arpon, et autres
Publié: (2024)

On Approximability of Satisfiable $k$-CSPs: VI
par: Bhangale, Amey, et autres
Publié: (2024)