Latest Research in Computability, Logic, AI Algorithms

Top Research Topics in Computability, Logic, AI Algorithms

• Computability, Logic, AI Algorithms — 53 papers
• Information Theory — 41 papers
• Combinatorics — 8 papers
• Data Structures and Algorithms — 7 papers
• Probability — 7 papers
• Cellular Automata and Applications — 7 papers
• Coding theory and cryptography — 7 papers
• Optimization and Control — 4 papers
• Computer Science and Game Theory — 3 papers
• Logic — 3 papers

Highest-Cited Papers

1. Absence of Rashba, Winding, and Möbius Topology in Submitted Abstracts — E8 Intelligence Research
2. Absence of Rashba, Winding, and Möbius Topology in Submitted Abstracts — E8 Intelligence Research
3. The Weight Algebra of Information States: A Two-Layer Commutative Semiring for Superposition and Pruning
4. Generalized Function-Correcting Partition Codes: Bounds and constructions
5. The Maximum Singularity Degree for Linear and Semidefinite Programming
6. A Mirror Vanishing Band for Weight Distributions of Binary Linear Codes
7. Norm-One Torus Decompositions and Decoding of Gashkov-Sidel'nikov Codes
8. Improved Algorithms for Beck--Fiala with Bounded Sets
9. Solutions to Three Conjectures and an Open Problem on Binary BCH Codes
10. Counterexamples to the Mao-Wu-Xu spectral conjecture and a three-scale boundary for spherical random graphs
11. Positive Evidence and Calibrated Mediation in Relational Spatial Reconstruction
12. Efficient Algorithms for Subdeterminant Maximization under Partition Matroids
13. Record times for coverage thresholds and maximal spacings
14. Counterexample to a Proposed Capacity Characterization of the Relay Channel
15. Universal behaviour of majority bootstrap percolation on high-dimensional geometric graphs
16. The spectral edge of sparse directed Erdös-Rényi graphs
17. On Periodic and Aperiodic Optimal Strategies in Solvency Games
18. The Expected Number of Distinct Substrings in an Alphabet String
19. Conservation of Quantitative Information under Change of Representation: Universal Carry Rigidity of Optimal Lossless Finite Quantity Codes
20. CPM-LDPC Codes Attaining the Minimum-Distance Bound