Enregistré dans:
| Auteur principal: | Simas, Tristan |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2601.15571 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023)
par: Latkin, Ivan V.
Publié: (2023)
Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)
par: Galatos, Nikolaos, et autres
Publié: (2025)
Generalisations of Matrix Partitions : Complexity and Obstructions
par: Barsukov, Alexey, et autres
Publié: (2021)
par: Barsukov, Alexey, et autres
Publié: (2021)
IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025)
par: Lela, Marko
Publié: (2025)
Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
par: Zhang, Manqing, et autres
Publié: (2026)
par: Zhang, Manqing, et autres
Publié: (2026)
#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
par: Bannach, Max, et autres
Publié: (2025)
par: Bannach, Max, et autres
Publié: (2025)
Truth-Aware Decoding: A Program-Logic Approach to Factual Language Generation
par: Alpay, Faruk, et autres
Publié: (2025)
par: Alpay, Faruk, et autres
Publié: (2025)
How Does Machine Learning Manage Complexity?
par: Fortnow, Lance
Publié: (2026)
par: Fortnow, Lance
Publié: (2026)
A Homological Separation of $\mathbf{P}$ from $\mathbf{NP}$ via Computational Topology and Category Theory
par: Tang, Jian-Gang
Publié: (2025)
par: Tang, Jian-Gang
Publié: (2025)
Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
par: Goldberg, Guy, et autres
Publié: (2025)
par: Goldberg, Guy, et autres
Publié: (2025)
Count-Free Weisfeiler--Leman and Group Isomorphism
par: Collins, Nathaniel A., et autres
Publié: (2022)
par: Collins, Nathaniel A., et autres
Publié: (2022)
Conserved active information
par: Chen, Yanchen, et autres
Publié: (2025)
par: Chen, Yanchen, et autres
Publié: (2025)
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
par: Grochow, Joshua A., et autres
Publié: (2021)
par: Grochow, Joshua A., et autres
Publié: (2021)
Approximate Distributed Coded Computing: Polynomial Codes and Randomized Sketching
par: Charalambides, Neophytos, et autres
Publié: (2026)
par: Charalambides, Neophytos, et autres
Publié: (2026)
Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers
par: Hakoniemi, Tuomas, et autres
Publié: (2024)
par: Hakoniemi, Tuomas, et autres
Publié: (2024)
Universal Algebra in UniMath
par: Amato, Gianluca, et autres
Publié: (2021)
par: Amato, Gianluca, et autres
Publié: (2021)
An MDL-Style Cost Functional KC, Distribution-Preserving Reductions ($A2^d$), and an $AC^0$+log Lower Bound for 3SAT via Balanced 3XOR
par: Lela, Marko
Publié: (2025)
par: Lela, Marko
Publié: (2025)
Continuous and algebraic domains in univalent foundations
par: de Jong, Tom, et autres
Publié: (2024)
par: de Jong, Tom, et autres
Publié: (2024)
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
par: Bruse, Florian, et autres
Publié: (2026)
par: Bruse, Florian, et autres
Publié: (2026)
Domains, Information Frames, and Their Logic
par: Spreen, Dieter
Publié: (2025)
par: Spreen, Dieter
Publié: (2025)
Locality, Consistency, and the Tractability Frontier
par: Simas, Tristan
Publié: (2026)
par: Simas, Tristan
Publié: (2026)
Formalizing Pick's Theorem in Isabelle/HOL
par: Binder, Sage, et autres
Publié: (2024)
par: Binder, Sage, et autres
Publié: (2024)
Determination of the fifth Busy Beaver value
par: The bbchallenge Collaboration, et autres
Publié: (2025)
par: The bbchallenge Collaboration, et autres
Publié: (2025)
Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
par: Wang, Zili, et autres
Publié: (2025)
par: Wang, Zili, et autres
Publié: (2025)
Formalizing MLTL Formula Progression in Isabelle/HOL
par: Kosaian, Katherine, et autres
Publié: (2024)
par: Kosaian, Katherine, et autres
Publié: (2024)
On the complexity of isomorphism problems for tensors, groups, and polynomials IV: linear-length reductions and their applications
par: Grochow, Joshua A., et autres
Publié: (2023)
par: Grochow, Joshua A., et autres
Publié: (2023)
An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility
par: Farmer, William M.
Publié: (2026)
par: Farmer, William M.
Publié: (2026)
Separation of PSPACE and EXP
par: Czerwinski, Reiner
Publié: (2021)
par: Czerwinski, Reiner
Publié: (2021)
A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
par: Ramos, Arthur, et autres
Publié: (2025)
par: Ramos, Arthur, et autres
Publié: (2025)
A novel framework for systematic propositional formula simplification based on existential graphs
par: de Mas, Jordina Francès, et autres
Publié: (2024)
par: de Mas, Jordina Francès, et autres
Publié: (2024)
The Polynomial Hierarchy does not collapse
par: Czerwinski, Reiner
Publié: (2024)
par: Czerwinski, Reiner
Publié: (2024)
Shifted Partial Derivative Polynomial Rank and Codimension
par: Edwards, Darren J.
Publié: (2025)
par: Edwards, Darren J.
Publié: (2025)
Completeness classes in algebraic complexity theory
par: Bürgisser, Peter
Publié: (2024)
par: Bürgisser, Peter
Publié: (2024)
The Solver's Paradox in Formal Problem Spaces
par: Rosko, Milan
Publié: (2025)
par: Rosko, Milan
Publié: (2025)
Computability of Initial Value Problems
par: Brattka, Vasco, et autres
Publié: (2024)
par: Brattka, Vasco, et autres
Publié: (2024)
An SoS Entropy Dichotomy via Windowed Hypercontractivity
par: Lela, Marko
Publié: (2025)
par: Lela, Marko
Publié: (2025)
The Fractal Logic of Phi-adic Recursion
par: Rosko, Milan
Publié: (2025)
par: Rosko, Milan
Publié: (2025)
Curved Boolean Logic: A Contextual Generalization of Propositional Logic with Algorithmic Consequences
par: von Liechtenstein, Maximilian R. P.
Publié: (2025)
par: von Liechtenstein, Maximilian R. P.
Publié: (2025)
Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
par: Huseynzade, Rafig
Publié: (2025)
par: Huseynzade, Rafig
Publié: (2025)
Smaller Depth-2 Linear Circuits for Disjointness Matrices
par: Ye, Lixi
Publié: (2026)
par: Ye, Lixi
Publié: (2026)
Documents similaires
-
A correspondence between the time and space complexity
par: Latkin, Ivan V.
Publié: (2023) -
Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025) -
Generalisations of Matrix Partitions : Complexity and Obstructions
par: Barsukov, Alexey, et autres
Publié: (2021) -
IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
par: Lela, Marko
Publié: (2025) -
Understanding and Improving Automated Proof Synthesis for Interactive Theorem Provers
par: Zhang, Manqing, et autres
Publié: (2026)