:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Makowski, Michał
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Information Theory F.1.3; H.1.1
Acceso en línea:	https://arxiv.org/abs/2408.02550
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Counting Complexity of the Skolem Problem
por: Jindal, Gorav, et al.
Publicado: (2024)

Catalytic Computing and Register Programs Beyond Log-Depth
por: Alekseev, Yaroslav, et al.
Publicado: (2025)

A point to set principle for finite-state dimension
por: Mayordomo, Elvira
Publicado: (2022)

Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
por: Bajaj, Divya, et al.
Publicado: (2026)

Explicit Commutative ROABPs from Partial Derivatives
por: Bhargava, Vishwas, et al.
Publicado: (2024)

Imperative process algebra and models of computation
por: Middelburg, C. A.
Publicado: (2022)

The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
por: Frydrych, Piotr
Publicado: (2026)

Functional Closure Properties of Finite $\mathbb{N}$-weighted Automata
por: Dörfler, Julian, et al.
Publicado: (2024)

Regular Model Checking for Systems with Effectively Regular Reachability Relation
por: Esparza, Javier, et al.
Publicado: (2025)

Tight bounds on depth-2 QAC-circuits computing parity
por: Fenner, Stephen, et al.
Publicado: (2025)

Multiplicative Turing Ensembles, Pareto's Law, and Creativity
por: Kolpakov, Alexander, et al.
Publicado: (2025)

Understanding Robust Catalytic Computing
por: Koucký, Michal, et al.
Publicado: (2026)

Disjunctive Complexity
por: Ivanov, Nikita, et al.
Publicado: (2025)

Data accounting and error counting
por: Gajda, Michał J.
Publicado: (2023)

The Complexity of Strategic Behavior in Primary Elections
por: Cleveland, Colin, et al.
Publicado: (2026)

Arithmetic Complexity of Solutions of the Dirichlet Problem
por: Boche, Holger, et al.
Publicado: (2026)

Anyone but Him: The Complexity of Precluding an Alternative
por: Hemaspaandra, Edith, et al.
Publicado: (2005)

Stochastic well-structured transition systems
por: Aspnes, James
Publicado: (2025)

Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
por: Kühn, Kolja, et al.
Publicado: (2026)

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
por: Hemaspaandra, Lane A., et al.
Publicado: (2021)

Graph Neural Networks and Arithmetic Circuits
por: Barlag, Timon, et al.
Publicado: (2024)

Average Attention Transformers and Arithmetic Circuits
por: Ehrmuth, Lena, et al.
Publicado: (2026)

Recurrent Graph Neural Networks and Arithmetic Circuits
por: Barlag, Timon, et al.
Publicado: (2026)

On the Complexity of Problems on Graphs Defined on Groups
por: Das, Bireswar, et al.
Publicado: (2025)

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
por: Anand, Emile, et al.
Publicado: (2024)

Benford's Law from Turing Ensembles and Integer Partitions
por: Kolpakov, Alexander, et al.
Publicado: (2025)

On Sampling Lower Bounds for Polynomials
por: Khodabandeh, Mohammad Mahdi, et al.
Publicado: (2026)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
por: Huseynzade, Rafig
Publicado: (2025)

Complexity Classes Arising from Circuits over Finite Algebraic Structures
por: Kawałek, Piotr, et al.
Publicado: (2026)

Realizable Circuit Complexity: Embedding Computation in Space-Time
por: Prada, Benjamin, et al.
Publicado: (2025)

On the Complexity of Determinations
por: Hellerstein, Joseph M.
Publicado: (2026)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
por: de Rezende, Susanna F., et al.
Publicado: (2026)

A LOCAL View of the Polynomial Hierarchy
por: Reiter, Fabian
Publicado: (2023)

Graph-Based Deterministic Polynomial Framwork for NP Problems
por: Lee, Changryeol
Publicado: (2025)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
por: de Rezende, Susanna F., et al.
Publicado: (2024)

Search versus Search for Collapsing Electoral Control Types
por: Carleton, Benjamin, et al.
Publicado: (2022)

L is different from NP
por: Montoya, J. Andres
Publicado: (2024)

Hausdorff Reductions and the Exponential Hierarchies
por: Malizia, Enrico
Publicado: (2024)

Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
por: Behera, Amik Raj, et al.
Publicado: (2026)

Lower Bounds for Symmetric Circuits for the Determinant
por: Dawar, Anuj, et al.
Publicado: (2021)