Image de couverture de livre

CircuitBuilder: From Polynomials to Circuits via Reinforcement Learning

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Weikun K., Pandey, Rohan, Mehta, Bhaumik, Jin, Kaijie, Morato, Naomi, Ganapule, Archit, Zeng, Michael Ruofan, Alper, Jarod
Format:	Preprint
Publié:	2026
Sujets:	Machine Learning Artificial Intelligence Computational Complexity 68Q06, 68T05, 68Q15, 68W30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
par: Kumar, Mrinal, et autres
Publié: (2018)

Polynomial Identity Testing via Evaluation of Rational Functions
par: Hu, Ivan, et autres
Publié: (2022)

Integer multiplication is at least as hard as matrix transposition
par: Harvey, David, et autres
Publié: (2025)

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
par: Lin, Tianrong
Publié: (2023)

Massively Parallel Modular Methods in Commutative Algebra and Algebraic Geometry
par: Basson, Dirk, et autres
Publié: (2024)

No Constant-Cost Protocol for Point--Line Incidence
par: Göös, Mika, et autres
Publié: (2026)

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups
par: Anokhin, Mikhail
Publié: (2025)

Unifying lower bounds for algebraic machines, semantically
par: Seiller, Thomas, et autres
Publié: (2018)

P not equal to NP
par: Delgado, Daniel Cardona
Publié: (2023)

The Separation of $NP$ and $PSPACE$
par: Lin, Tianrong
Publié: (2021)

Runtime Analyses of NSGA-III on Many-Objective Problems
par: Opris, Andre, et autres
Publié: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
par: Opris, Andre, et autres
Publié: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
par: Opris, Andre
Publié: (2025)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
par: Rokhlin, Dmitry B., et autres
Publié: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
par: Rokhlin, Dmitry B.
Publié: (2025)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
par: Saffidine, Abdallah, et autres
Publié: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Robust Tensor CUR Decompositions: Rapid Low-Tucker-Rank Tensor Recovery with Sparse Corruption
par: Cai, HanQin, et autres
Publié: (2023)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
par: Bodnar, Levente
Publié: (2024)

A Study of NP-Completeness and Undecidable Word Problems in Semigroups
par: Abdullah, Duaa, et autres
Publié: (2025)

Hamiltonicity Parameterized by Mim-Width is (Indeed) Para-NP-Hard
par: Bergougnoux, Benjamin, et autres
Publié: (2025)

Quantifying The Limits of AI Reasoning: Systematic Neural Network Representations of Algorithms
par: Kratsios, Anastasis, et autres
Publié: (2025)

RotorMap and Quantum Fingerprints of DNA Sequences via Rotary Position Embeddings
par: Yakymenko, Danylo, et autres
Publié: (2026)

Some derivations among Logarithmic Space Bounded Counting Classes
par: Janaki, V., et autres
Publié: (2023)

Smaller Depth-2 Linear Circuits for Disjointness Matrices
par: Ye, Lixi
Publié: (2026)

Undefinability of Approximation of 2-to-2 Games
par: Dawar, Anuj, et autres
Publié: (2025)

Dynamic T-decomposition for classical simulation of quantum circuits
par: Ahmad, Wira Azmoon, et autres
Publié: (2024)

Diagonalization of Polynomial-Time Deterministic Turing Machines via Nondeterministic Turing Machines
par: Lin, Tianrong
Publié: (2021)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
par: Roucairol, Milo, et autres
Publié: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
par: Opris, Andre
Publié: (2025)

Toward P vs NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model
par: Edwards, Darren J.
Publié: (2025)

On the Parenthesisations of Matrix Chains: All are Useful, Few Are Essential
par: López, Francisco, et autres
Publié: (2023)

Recent Advances in Debordering Methods
par: Dutta, Pranjal, et autres
Publié: (2025)

Teaching and Learning under Deductive Errors
par: Telle, Jan Arne, et autres
Publié: (2026)

Weighted Automata and Logics Meet Computational Complexity
par: Kostolányi, Peter
Publié: (2023)

Shortest Paths in a Weighted Simplicial Complex
par: Chakraborty, Sukrit, et autres
Publié: (2025)

Optimal phase change for a generalized Grover's algorithm
par: Cardullo, Christopher, et autres
Publié: (2025)

Beyond the Existential Theory of the Reals
par: Schaefer, Marcus, et autres
Publié: (2022)