Latest Research in Constraint Satisfaction and Optimization

Top Research Topics in Constraint Satisfaction and Optimization

• Computability, Logic, AI Algorithms — 7 papers
• Formal Languages and Automata Theory — 4 papers
• Constraint Satisfaction and Optimization — 3 papers
• Data Structures and Algorithms — 3 papers
• Intelligence, Security, War Strategy — 3 papers
• Computer Science and Game Theory — 2 papers
• Computational Complexity — 2 papers
• Graph Theory and Algorithms — 2 papers
• Information Theory — 1 papers
• Logic, programming, and type systems — 1 papers

Highest-Cited Papers

1. The Inherent Limits of Formal Systems: Undecidability and Incompleteness — E8 Intelligence Research
2. Locality Causes Tractability? An Intervention Study on the Variable-Interaction Radius in Geometric Random Satisfiability (Compact Version)
3. Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity
4. Learning Depth-3 Circuits with Polynomial Savings
5. Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
6. Polynomially larger deletion codes by linear hashing of substring counts
7. Locality Causes Tractability? An Intervention Study on the Variable-Interaction Radius in Geometric Random Satisfiability (Compact Version)
8. Competition Problem Corpus Analysis: Windmill Depth, No Single Hardest Theorem — E8 Intelligence Research
9. Gödel's Incompleteness: True but Unprovable, Consistency Unprovable — E8 Intelligence Research
10. Gödel's Incompleteness: True Statements Beyond Axiomatic Proof — E8 Intelligence Research
11. The Relativization Barrier: Why Oracles Cannot Settle P vs NP — E8 Intelligence Research
12. An Elementary Proof of the $\widetilde O(n^{1/3})$ Bound for Separating Words
13. The Complexity of Membership, Uniqueness, and Counting for Optimal Proportional Approval Voting Committees
14. EFX Allocations for Three Agents and Seven or Eight Chores
15. Minimal Axioms of Causal Inheritance: An Axiomatic Construction from Update Identity to Structural Generation
16. Gödel's Incompleteness: Unprovable Truths and the Limits of Formal Systems — E8 Intelligence Research
17. Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
18. New Semantic Unit Operations: A Graph-Theoretical Metamodel for Recursive Fallback and Spatial Branching in Valuation Networks.
19. New Semantic Unit Operations: A Graph-Theoretical Metamodel for Recursive Fallback and Spatial Branching in Valuation Networks.
20. On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm