Spremljeno u:
| Glavni autori: | , , , |
|---|---|
| Format: | Preprint |
| Izdano: |
2026
|
| Teme: | |
| Online pristup: | https://arxiv.org/abs/2602.11292 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
Slični predmeti
Eulerian orientations and Hadamard codes: A novel connection via counting
od: Shao, Shuai, i dr.
Izdano: (2024)
od: Shao, Shuai, i dr.
Izdano: (2024)
Complexity of Unambiguous Problems in $Σ^P_2$
od: Gilboa, Matan, i dr.
Izdano: (2025)
od: Gilboa, Matan, i dr.
Izdano: (2025)
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
od: Chauhan, Archit, i dr.
Izdano: (2026)
od: Chauhan, Archit, i dr.
Izdano: (2026)
Realizable Circuit Complexity: Embedding Computation in Space-Time
od: Prada, Benjamin, i dr.
Izdano: (2025)
od: Prada, Benjamin, i dr.
Izdano: (2025)
A Note On The Natural Range Of Unambiguous-SAT
od: Pay, Tayfun
Izdano: (2023)
od: Pay, Tayfun
Izdano: (2023)
On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
od: Cheval, Vincent, i dr.
Izdano: (2025)
od: Cheval, Vincent, i dr.
Izdano: (2025)
An Optimal Randomized Algorithm for Finding the Saddlepoint
od: Dallant, Justin, i dr.
Izdano: (2024)
od: Dallant, Justin, i dr.
Izdano: (2024)
Graph-Based Deterministic Polynomial Framwork for NP Problems
od: Lee, Changryeol
Izdano: (2025)
od: Lee, Changryeol
Izdano: (2025)
Nonuniform Deterministic Finite Automata over finite algebraic structures
od: Idziak, Paweł M., i dr.
Izdano: (2025)
od: Idziak, Paweł M., i dr.
Izdano: (2025)
Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework
od: Luberisse, Joshua
Izdano: (2025)
od: Luberisse, Joshua
Izdano: (2025)
Constructibility and the P versus NP problem
od: Hole, Arne
Izdano: (2024)
od: Hole, Arne
Izdano: (2024)
Condensing and Extracting Against Online Adversaries
od: Chattopadhyay, Eshan, i dr.
Izdano: (2024)
od: Chattopadhyay, Eshan, i dr.
Izdano: (2024)
QSETH strikes again: finer quantum lower bounds for lattice problem, strong simulation, hitting set problem, and more
od: Chen, Yanlin, i dr.
Izdano: (2023)
od: Chen, Yanlin, i dr.
Izdano: (2023)
Max-Cut with $ε$-Accurate Predictions
od: Cohen-Addad, Vincent, i dr.
Izdano: (2024)
od: Cohen-Addad, Vincent, i dr.
Izdano: (2024)
Completing the Complexity Classification of 2-Solo Chess: Knights and Kings are Hard
od: Kühn, Kolja, i dr.
Izdano: (2026)
od: Kühn, Kolja, i dr.
Izdano: (2026)
A Note on the NP-Hardness of PARTITION Via First-Order Projections
od: Iturralde, Paúl Risco
Izdano: (2025)
od: Iturralde, Paúl Risco
Izdano: (2025)
Structure-Guided Automated Reasoning
od: Bannach, Max, i dr.
Izdano: (2023)
od: Bannach, Max, i dr.
Izdano: (2023)
Small Shadow Partitions
od: Kopparty, Swastik, i dr.
Izdano: (2024)
od: Kopparty, Swastik, i dr.
Izdano: (2024)
Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
od: Lokshtanov, Daniel, i dr.
Izdano: (2024)
od: Lokshtanov, Daniel, i dr.
Izdano: (2024)
Simple Stochastic Stopping Games: A Generator and Benchmark Library
od: Rudich, Avi, i dr.
Izdano: (2024)
od: Rudich, Avi, i dr.
Izdano: (2024)
Fair Vertex Problems Parameterized by Cluster Vertex Deletion
od: Masařík, Tomáš, i dr.
Izdano: (2025)
od: Masařík, Tomáš, i dr.
Izdano: (2025)
A Theory for Probabilistic Polynomial-Time Reasoning
od: Chen, Lijie, i dr.
Izdano: (2026)
od: Chen, Lijie, i dr.
Izdano: (2026)
On the formalization of the notion of a concurrent algorithm
od: Middelburg, C. A.
Izdano: (2024)
od: Middelburg, C. A.
Izdano: (2024)
On the formalization of the notion of an algorithm
od: Middelburg, C. A.
Izdano: (2024)
od: Middelburg, C. A.
Izdano: (2024)
Replicability in High Dimensional Statistics
od: Hopkins, Max, i dr.
Izdano: (2024)
od: Hopkins, Max, i dr.
Izdano: (2024)
A Theoretical Computer Science Perspective on Free Will
od: Blum, Manuel, i dr.
Izdano: (2022)
od: Blum, Manuel, i dr.
Izdano: (2022)
On the Decidability of Verification under Release/Acquire
od: Conrado, Giovanna Kobus, i dr.
Izdano: (2026)
od: Conrado, Giovanna Kobus, i dr.
Izdano: (2026)
PosSLP and Sum of Squares
od: Bläser, Markus, i dr.
Izdano: (2024)
od: Bläser, Markus, i dr.
Izdano: (2024)
Program Analysis via Multiple Context Free Language Reachability
od: Conrado, Giovanna Kobus, i dr.
Izdano: (2024)
od: Conrado, Giovanna Kobus, i dr.
Izdano: (2024)
Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups
od: Cai, Jin-Yi, i dr.
Izdano: (2026)
od: Cai, Jin-Yi, i dr.
Izdano: (2026)
Formalizing the notions of non-interactive and interactive algorithms
od: Middelburg, C. A.
Izdano: (2024)
od: Middelburg, C. A.
Izdano: (2024)
Smaller Depth-2 Linear Circuits for Disjointness Matrices
od: Ye, Lixi
Izdano: (2026)
od: Ye, Lixi
Izdano: (2026)
I/O complexity and pebble games with partial computations
od: Sobczyk, Aleksandros
Izdano: (2024)
od: Sobczyk, Aleksandros
Izdano: (2024)
Improved Bounds for Coin Flipping, Leader Election, and Random Selection
od: Chattopadhyay, Eshan, i dr.
Izdano: (2025)
od: Chattopadhyay, Eshan, i dr.
Izdano: (2025)
Descriptive complexity for neural networks via Boolean networks
od: Ahvonen, Veeti, i dr.
Izdano: (2023)
od: Ahvonen, Veeti, i dr.
Izdano: (2023)
Disjunctive Complexity
od: Ivanov, Nikita, i dr.
Izdano: (2025)
od: Ivanov, Nikita, i dr.
Izdano: (2025)
A Fine-Grained Complexity View on Propositional Abduction -- Algorithms and Lower Bounds
od: Lagerkvist, Victor, i dr.
Izdano: (2025)
od: Lagerkvist, Victor, i dr.
Izdano: (2025)
On the Complexity of Determinations
od: Hellerstein, Joseph M.
Izdano: (2026)
od: Hellerstein, Joseph M.
Izdano: (2026)
On the Complexity of Vertex-Splitting Into an Interval Graph
od: Abu-Khzam, Faisal N., i dr.
Izdano: (2026)
od: Abu-Khzam, Faisal N., i dr.
Izdano: (2026)
On the Complexity of Claw-Free Vertex Splitting
od: Abu-Khzam, Faisal N., i dr.
Izdano: (2025)
od: Abu-Khzam, Faisal N., i dr.
Izdano: (2025)