Latest Research in Computational Complexity

Top Research Topics in Computational Complexity

• Computability, Logic, AI Algorithms — 16 papers
• Information Theory — 12 papers
• Computational Complexity — 3 papers
• Combinatorics — 3 papers
• Logic in Computer Science — 2 papers
• Data Structures and Algorithms — 2 papers
• Intelligence, Security, War Strategy — 2 papers
• Coding theory and cryptography — 2 papers
• Benford’s Law and Fraud Detection — 2 papers
• Quantum Computing Algorithms and Architecture — 1 papers

Highest-Cited Papers

1. On Revisiting Gödel's Incompleteness and Turing's Undecidability of the Halting Problem
2. On Revisiting Gödel's Incompleteness and Turing's Undecidability of the Halting Problem
3. Gödel's Limits: Unprovable Truths and the Ordinal Strength of Formal Systems — E8 Intelligence Research
4. Hulls of Non-Separable Constacyclic Codes over FqR and Their Applications in Constructing New QECCs
5. Galois Hulls of Generalized Roth-Lempel Codes and Their Applications to EAQECCs
6. Deciding Predicate Logical Theories of Real-Valued Functions
7. Hyper-derivative Algebraic Geometry Codes via Local Expansions
8. On Twisted Roth-Lempel Codes
9. Determinant maximization subject to a partition matroid constraint via stable distributions
10. Menichetti's nonassociative $G$-crossed product algebras and Menichetti codes
11. Further results on binary codes of covering radius 2 and saturating sets in projective spaces
12. The Undecidable Gap: Diagonalization and the Incompleteness of Turing Degrees — E8 Intelligence Research
13. The two applications of similarity on residuated lattices
14. Generative Structural Theory v1.9: Finite Simulation Rank, Tightness and Certificate Inheritance
15. Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs
16. Baire Category Theorem: Dense Intersections and Meager-Comeager Dichotomy — E8 Intelligence Research
17. About a Ball Removal Process on Bins
18. IMO 2025 Problems 1, 2, 6: Geometry and Combinatorics Overview — E8 Intelligence Research
19. IMO 2025 Problems 1, 2, 6: Geometry and Combinatorics Overview — E8 Intelligence Research
20. Quantum MDS codes from complements of unions of finite-field subsets