Imagen de Portada

The Zeta ($ζ$) Notation for Complex Asymptotes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dutta, Anurag, Lakshmanan, K., Harshith, John, Ramamoorthy, A., Pradeep, C., Kumar, Pijush Kanti
Formato:	Preprint
Publicado:	2023
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Comparative Investigation into the Operation of an Optimal Control Problem: The Maximal Stretch
por: Dutta, Anurag, et al.
Publicado: (2024)

Computational Complexity of Finding Subgroups of a Given Order
por: Lakshmanan, K.
Publicado: (2025)

A New Representation of the Riemann Zeta Function $ζ(s)$
por: Woon, S. C.
Publicado: (1998)

The Complexity of Order-Finding for ROABPs
por: Bhargava, Vishwas, et al.
Publicado: (2024)

Local Polynomial Convexity at Hyperbolic CR-singularities in $M \subset \mathbb{C}^n$
por: Alagandala, Harshith
Publicado: (2025)

Random Permutations in Computational Complexity
por: Hitchcock, John M., et al.
Publicado: (2025)

Exponential-Size Circuit Complexity is Comeager in Symmetric Exponential Time
por: Hitchcock, John M.
Publicado: (2026)

The Complexity of Logarithmic Space Bounded Counting Classes
por: Vijayaraghavan, T. C.
Publicado: (2025)

Derandomizing Multivariate Polynomial Factoring for Low Degree Factors
por: Dutta, Pranjal, et al.
Publicado: (2024)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
por: Cavalar, Bruno P., et al.
Publicado: (2025)

Exponential lower bound via exponential sums
por: Bhattacharjee, Somnath, et al.
Publicado: (2026)

Structure in Communication Complexity and Constant-Cost Complexity Classes
por: Hatami, Hamed, et al.
Publicado: (2024)

Circuit-to-Hamiltonian from tensor networks and fault tolerance
por: Anshu, Anurag, et al.
Publicado: (2023)

An Overview of the Theory of Instances Computational Complexity
por: Jorge A. Ruiz-Vanoye
Publicado: (2011)

From Proof Complexity to Circuit Complexity via Interactive Protocols
por: Arteche, Noel, et al.
Publicado: (2024)

A Note on the Complexity of Bilevel Linear Programs in Fixed Dimensions
por: Ketkov, Sergey S., et al.
Publicado: (2025)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2026)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
por: Przybyłek, Michał R., et al.
Publicado: (2026)

The Complexity of Tensor Rank
por: Schaefer, Marcus, et al.
Publicado: (2016)

Pseudodeterministic Communication Complexity
por: Göös, Mika, et al.
Publicado: (2025)

Query Complexity with Unknowns
por: Mande, Nikhil S., et al.
Publicado: (2024)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
por: Nalli, Sai Soumya, et al.
Publicado: (2026)

On the complexity of unique quantum witnesses and quantum approximate counting
por: Anshu, Anurag, et al.
Publicado: (2024)

The Radical Solution and Computational Complexity
por: Zheng, Bojin, et al.
Publicado: (2024)

The Computational Complexity of Factored Graphs
por: Gupta, Shreya, et al.
Publicado: (2024)

Separations in Proof Complexity and TFNP
por: Göös, Mika, et al.
Publicado: (2022)

On the Complexity of Hazard-Free Formulas
por: Arazi, Leah London, et al.
Publicado: (2024)

Communication Complexity is NP-hard
por: Hirahara, Shuichi, et al.
Publicado: (2025)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
por: Daghbouche, Karim
Publicado: (2025)

Parameterized Complexity of the Star Decomposition Problem
por: Hajebi, Sahab, et al.
Publicado: (2024)

On the Complexity of Claw-Free Vertex Splitting
por: Abu-Khzam, Faisal N., et al.
Publicado: (2025)

Properties of calculus in r-Complexity 2025
por: Folea, Rares, et al.
Publicado: (2026)

The Parameterized Complexity of Coloring Mixed Graphs
por: Lauerbach, Antonio, et al.
Publicado: (2026)

An XOR Lemma for Deterministic Communication Complexity
por: Iyer, Siddharth, et al.
Publicado: (2024)

On the Complexity of Problems on Tree-structured Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2022)

On the Complexity of Combinatorial Optimization on Fixed Structures
por: Megiddo, Nimrod
Publicado: (2024)

Computational Complexity of Game Boy Games
por: Tirmazi, Hayder, et al.
Publicado: (2024)

Multiparty Communication Complexity of Collision Finding
por: Beame, Paul, et al.
Publicado: (2024)

Hexasort -- The Complexity of Stacking Colors on Graphs
por: Klocker, Linus, et al.
Publicado: (2026)

A Note on the Complexity of Defensive Domination
por: Chaplick, Steven, et al.
Publicado: (2025)