Imagen de Portada

Identity Testing for Circuits with Exponentiation Gates

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Jiatu, Wu, Mengdi
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Data Structures and Algorithms F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
por: Kowaluk, Miroslaw, et al.
Publicado: (2025)

Towards universally optimal sorting algorithms
por: Sen, Sandeep
Publicado: (2025)

Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction
por: Krithika, R., et al.
Publicado: (2023)

Spanning Trees Minimizing Branching Costs
por: Gargano, Luisa, et al.
Publicado: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
por: Gilfanov, Arthur
Publicado: (2024)

SARRIGUREN: a polynomial-time complete algorithm for random $k$-SAT with relatively dense clauses
por: Sarriguren, Alfredo Goñi
Publicado: (2024)

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
por: Dvořák, Pavel, et al.
Publicado: (2017)

Realizing temporal graphs from fastest travel times
por: Klobas, Nina, et al.
Publicado: (2023)

A Piecewise Approach for the Analysis of Exact Algorithms
por: Clinch, Katie, et al.
Publicado: (2024)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
por: Salas, Jesus
Publicado: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
por: Saha, Barna, et al.
Publicado: (2024)

A Decomposition Approach to the Weighted $k$-server Problem
por: Ayyadevara, Nikhil, et al.
Publicado: (2024)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
por: Lingas, Andrzej
Publicado: (2026)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

When Votes Change and Committees Should (Not)
por: Bredereck, Robert, et al.
Publicado: (2020)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
por: Jansen, Klaus, et al.
Publicado: (2024)

Large cliques and large independent sets: can they coexist?
por: Feige, Uriel, et al.
Publicado: (2025)

Hierarchical Exponential Search Via K-Spines
por: Dong, Bob
Publicado: (2025)

Kernelization dichotomies for hitting minors under structural parameterizations
por: Bougeret, Marin, et al.
Publicado: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
por: Bougeret, Marin, et al.
Publicado: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
por: Gouvine, Gabriel
Publicado: (2023)

Balanced Substructures in Bicolored Graphs
por: Ardra, P. S., et al.
Publicado: (2024)

Eliminating Illusion in Directed Networks
por: Jana, Sougata, et al.
Publicado: (2026)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Scheduling with Obligatory Tests
por: Dogeas, Konstantinos, et al.
Publicado: (2024)

Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity
por: Liao, Chao, et al.
Publicado: (2022)

Tree Containment Parameterized by Scanwidth
por: van Iersel, Leo, et al.
Publicado: (2026)

Fast Order Statistics with Group Inequality Testing
por: Liyanage, Adiesha, et al.
Publicado: (2025)

Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
por: Chauhan, Archit, et al.
Publicado: (2025)

Complexity of Finding and Enumerating Interconnection Trees
por: Demange, Noé, et al.
Publicado: (2026)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Multiplication of 0-1 matrices via clustering
por: Jansson, Jesper, et al.
Publicado: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
por: Kowaluk, Mirosław, et al.
Publicado: (2025)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
por: Lokshtanov, Daniel, et al.
Publicado: (2024)