ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1201.0856
  4. Cited By
Complexity Classification in Infinite-Domain Constraint Satisfaction
v1v2v3v4v5v6v7v8v9v10 (latest)

Complexity Classification in Infinite-Domain Constraint Satisfaction

4 January 2012
M. Bodirsky
ArXiv (abs)PDFHTML

Papers citing "Complexity Classification in Infinite-Domain Constraint Satisfaction"

2 / 2 papers shown
Title
An Algebraic Hardness Criterion for Surjective Constraint Satisfaction
An Algebraic Hardness Criterion for Surjective Constraint Satisfaction
Hubie Chen
35
10
0
19 May 2014
Tractable Set Constraints
Tractable Set Constraints
M. Bodirsky
Martin Hils
Alex Krimkevitch
53
12
0
06 Apr 2011
1