arXiv cs.CC Computational Complexity
@cscc-bot.bsky.social
Unofficial bot by @vele.bsky.social w/ http://github.com/so-okada/bXiv https://arxiv.org/list/cs.CC/new
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
List https://bsky.app/profile/vele.bsky.social/lists/3lim7ccweqo2j
ModList https://bsky.app/profile/vele.bsky.social/lists/3lim3qnexsw2g
[2025-12-26 Fri (UTC), no new articles found for csCC Computational Complexity]
December 26, 2025 at 6:34 AM
[2025-12-26 Fri (UTC), no new articles found for csCC Computational Complexity]
Reposted by arXiv cs.CC Computational Complexity
Brani Vidakovic: Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization https://arxiv.org/abs/2512.21193 https://arxiv.org/pdf/2512.21193 https://arxiv.org/html/2512.21193
December 25, 2025 at 6:52 AM
Brani Vidakovic: Adjusted Kolmogorov Complexity of Binary Words with Empirical Entropy Normalization https://arxiv.org/abs/2512.21193 https://arxiv.org/pdf/2512.21193 https://arxiv.org/html/2512.21193
Reposted by arXiv cs.CC Computational Complexity
James Aspnes: Stochastic well-structured transition systems https://arxiv.org/abs/2512.20939 https://arxiv.org/pdf/2512.20939 https://arxiv.org/html/2512.20939
December 25, 2025 at 6:30 AM
James Aspnes: Stochastic well-structured transition systems https://arxiv.org/abs/2512.20939 https://arxiv.org/pdf/2512.20939 https://arxiv.org/html/2512.20939
Darren J. Edwards: Shifted Partial Derivative Polynomial Rank and Codimension https://arxiv.org/abs/2512.20729 https://arxiv.org/pdf/2512.20729 https://arxiv.org/html/2512.20729
December 25, 2025 at 6:29 AM
Darren J. Edwards: Shifted Partial Derivative Polynomial Rank and Codimension https://arxiv.org/abs/2512.20729 https://arxiv.org/pdf/2512.20729 https://arxiv.org/html/2512.20729
[2025-12-25 Thu (UTC), 1 new article found for csCC Computational Complexity]
December 25, 2025 at 6:29 AM
[2025-12-25 Thu (UTC), 1 new article found for csCC Computational Complexity]
[2025-12-24 Wed (UTC), no new articles found for csCC Computational Complexity]
December 24, 2025 at 6:29 AM
[2025-12-24 Wed (UTC), no new articles found for csCC Computational Complexity]
Reposted by arXiv cs.CC Computational Complexity
Eva Miranda, Isaac Ramos: Classical billiards can compute https://arxiv.org/abs/2512.19156 https://arxiv.org/pdf/2512.19156 https://arxiv.org/html/2512.19156
December 23, 2025 at 6:37 AM
Eva Miranda, Isaac Ramos: Classical billiards can compute https://arxiv.org/abs/2512.19156 https://arxiv.org/pdf/2512.19156 https://arxiv.org/html/2512.19156
Reposted by arXiv cs.CC Computational Complexity
Leroy Cronin, Juan Carlos Morales Parra, Keith Y. Patarroyo: Assembly Addition Chains https://arxiv.org/abs/2512.18030 https://arxiv.org/pdf/2512.18030 https://arxiv.org/html/2512.18030
December 23, 2025 at 6:37 AM
Leroy Cronin, Juan Carlos Morales Parra, Keith Y. Patarroyo: Assembly Addition Chains https://arxiv.org/abs/2512.18030 https://arxiv.org/pdf/2512.18030 https://arxiv.org/html/2512.18030
Bruno Cavalar, Th\'eo Bor\'em Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff: Negations are powerful even in small depth https://arxiv.org/abs/2512.19515 https://arxiv.org/pdf/2512.19515 https://arxiv.org/html/2512.19515
December 23, 2025 at 6:29 AM
Bruno Cavalar, Th\'eo Bor\'em Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff: Negations are powerful even in small depth https://arxiv.org/abs/2512.19515 https://arxiv.org/pdf/2512.19515 https://arxiv.org/html/2512.19515
Moses Ganardi, Markus Lohrey: On the complexity of computing Strahler numbers https://arxiv.org/abs/2512.19060 https://arxiv.org/pdf/2512.19060 https://arxiv.org/html/2512.19060
December 23, 2025 at 6:29 AM
Moses Ganardi, Markus Lohrey: On the complexity of computing Strahler numbers https://arxiv.org/abs/2512.19060 https://arxiv.org/pdf/2512.19060 https://arxiv.org/html/2512.19060
[2025-12-23 Tue (UTC), 2 new articles found for csCC Computational Complexity]
December 23, 2025 at 6:29 AM
[2025-12-23 Tue (UTC), 2 new articles found for csCC Computational Complexity]
Reposted by arXiv cs.CC Computational Complexity
Istv\'an Mikl\'os: On the Complexity of Bipartite Degree Realizability https://arxiv.org/abs/2512.17709 https://arxiv.org/pdf/2512.17709 https://arxiv.org/html/2512.17709
December 22, 2025 at 6:37 AM
Istv\'an Mikl\'os: On the Complexity of Bipartite Degree Realizability https://arxiv.org/abs/2512.17709 https://arxiv.org/pdf/2512.17709 https://arxiv.org/html/2512.17709
Reposted by arXiv cs.CC Computational Complexity
Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou: Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms https://arxiv.org/abs/2512.17663 https://arxiv.org/pdf/2512.17663 https://arxiv.org/html/2512.17663
December 22, 2025 at 6:31 AM
Antonios Antoniadis, Denise Graafsma, Ruben Hoeksma, Maria Vlasiou: Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms https://arxiv.org/abs/2512.17663 https://arxiv.org/pdf/2512.17663 https://arxiv.org/html/2512.17663
Reposted by arXiv cs.CC Computational Complexity
Andreas Krebs, Arne Meier: When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames https://arxiv.org/abs/2512.17378 https://arxiv.org/pdf/2512.17378 https://arxiv.org/html/2512.17378
December 22, 2025 at 6:32 AM
Andreas Krebs, Arne Meier: When Symmetry Yields NP-Hardness: Affine ML-SAT on S5 Frames https://arxiv.org/abs/2512.17378 https://arxiv.org/pdf/2512.17378 https://arxiv.org/html/2512.17378
[2025-12-22 Mon (UTC), no new articles found for csCC Computational Complexity]
December 22, 2025 at 6:29 AM
[2025-12-22 Mon (UTC), no new articles found for csCC Computational Complexity]
Simone Ingrid Monteiro Gama, Rosiane de Freitas Rodrigues: Analogicity in List Coloring Problems and Interval $k$-$(\gamma,\mu)$-choosability: A Complexity-Theoretic Study https://arxiv.org/abs/2512.16807 https://arxiv.org/pdf/2512.16807 https://arxiv.org/html/2512.16807
December 19, 2025 at 6:29 AM
Simone Ingrid Monteiro Gama, Rosiane de Freitas Rodrigues: Analogicity in List Coloring Problems and Interval $k$-$(\gamma,\mu)$-choosability: A Complexity-Theoretic Study https://arxiv.org/abs/2512.16807 https://arxiv.org/pdf/2512.16807 https://arxiv.org/html/2512.16807
Klaus Jansen, Tobias M\"omke, Bj\"orn Schumacher: Hardness of SetCover Reoptimization https://arxiv.org/abs/2512.16805 https://arxiv.org/pdf/2512.16805 https://arxiv.org/html/2512.16805
December 19, 2025 at 6:29 AM
Klaus Jansen, Tobias M\"omke, Bj\"orn Schumacher: Hardness of SetCover Reoptimization https://arxiv.org/abs/2512.16805 https://arxiv.org/pdf/2512.16805 https://arxiv.org/html/2512.16805
Uriya First, Stav Lazarovici: Good Locally Testable Codes with Small Alphabet and Small Query Size https://arxiv.org/abs/2512.16082 https://arxiv.org/pdf/2512.16082 https://arxiv.org/html/2512.16082
December 19, 2025 at 6:29 AM
Uriya First, Stav Lazarovici: Good Locally Testable Codes with Small Alphabet and Small Query Size https://arxiv.org/abs/2512.16082 https://arxiv.org/pdf/2512.16082 https://arxiv.org/html/2512.16082
[2025-12-19 Fri (UTC), 3 new articles found for csCC Computational Complexity]
December 19, 2025 at 6:29 AM
[2025-12-19 Fri (UTC), 3 new articles found for csCC Computational Complexity]
[2025-12-18 Thu (UTC), no new articles found for csCC Computational Complexity]
December 18, 2025 at 6:29 AM
[2025-12-18 Thu (UTC), no new articles found for csCC Computational Complexity]
Reposted by arXiv cs.CC Computational Complexity
Malvika Raj Joshi, Avishay Tal, Francisca Vasconcelos, John Wright: Improved Lower Bounds for QAC0 https://arxiv.org/abs/2512.14643 https://arxiv.org/pdf/2512.14643 https://arxiv.org/html/2512.14643
December 17, 2025 at 6:50 AM
Malvika Raj Joshi, Avishay Tal, Francisca Vasconcelos, John Wright: Improved Lower Bounds for QAC0 https://arxiv.org/abs/2512.14643 https://arxiv.org/pdf/2512.14643 https://arxiv.org/html/2512.14643
[2025-12-17 Wed (UTC), no new articles found for csCC Computational Complexity]
December 17, 2025 at 6:29 AM
[2025-12-17 Wed (UTC), no new articles found for csCC Computational Complexity]
Reposted by arXiv cs.CC Computational Complexity
Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip: Space Efficient Algorithms for Parameterised Problems https://arxiv.org/abs/2512.13342 https://arxiv.org/pdf/2512.13342 https://arxiv.org/html/2512.13342
December 16, 2025 at 6:31 AM
Sheikh Shakil Akhtar, Pranabendu Misra, Geevarghese Philip: Space Efficient Algorithms for Parameterised Problems https://arxiv.org/abs/2512.13342 https://arxiv.org/pdf/2512.13342 https://arxiv.org/html/2512.13342
Reposted by arXiv cs.CC Computational Complexity
Wei-Chen Lee, Martin Bullinger, Alessandro Abate, Michael Wooldridge: Fair Coordination in Strategic Scheduling https://arxiv.org/abs/2512.13244 https://arxiv.org/pdf/2512.13244 https://arxiv.org/html/2512.13244
December 16, 2025 at 6:32 AM
Wei-Chen Lee, Martin Bullinger, Alessandro Abate, Michael Wooldridge: Fair Coordination in Strategic Scheduling https://arxiv.org/abs/2512.13244 https://arxiv.org/pdf/2512.13244 https://arxiv.org/html/2512.13244
Reposted by arXiv cs.CC Computational Complexity
Marin Bougeret, Eric Brandwein, Ignasi Sau: Kernelization dichotomies for hitting minors under structural parameterizations https://arxiv.org/abs/2512.13210 https://arxiv.org/pdf/2512.13210 https://arxiv.org/html/2512.13210
December 16, 2025 at 6:31 AM
Marin Bougeret, Eric Brandwein, Ignasi Sau: Kernelization dichotomies for hitting minors under structural parameterizations https://arxiv.org/abs/2512.13210 https://arxiv.org/pdf/2512.13210 https://arxiv.org/html/2512.13210