The Complexity of Satisfaction Problems in Reverse Mathematics

Computability - Netherlands
doi 10.3233/com-150034
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

The Resolution Complexity of Random Constraint Satisfaction Problems

SIAM Journal on Computing
MathematicsComputer Science
2007English

Reverse Mathematics

Notices of the American Mathematical Society
Mathematics
2018English

Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

Linköping Studies in Science and Technology. Dissertations
2020English

Reverse Mathematics: The Playground of Logic

Bulletin of Symbolic Logic
PhilosophyLogic
2010English

Representations of Reals in Reverse Mathematics

Bulletin of the Polish Academy of Sciences Mathematics
2007English

Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns

English

The Gödel Hierarchy and Reverse Mathematics

English

Advanced Problems in Mathematics

Mathematical Gazette
Mathematics
1998English

Reverse Mathematics and Algebraic Field Extensions

Computability
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy