Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems

Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems is a science project.

Event research_grant eu_cordis:795936
Press Enter · cited answer in seconds

Key Facts

  • Start time: July 1, 2018[1]
  • End time: April 29, 2021[2]
  • Participant: University of Cambridge[3]
  • Short name: InfCSP[4]
  • Budget: 195454.8 euro[5]
  • Funding scheme: Horizon 2020[6]

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems. Retrieved October 8, 2026, from https://4ort.xyz/entity/descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems
MLA “Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems.” 4ort.xyz Knowledge Graph, 4ort.xyz, 8 Oct. 2026, https://4ort.xyz/entity/descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems.
BibTeX @misc{4ortxyz_descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems}}, year = {2026}, url = {https://4ort.xyz/entity/descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems}, note = {Accessed: 2026-10-08}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Descriptive Complexity of Infinite Domain Constraint Satisfaction Problems — https://4ort.xyz/entity/descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems (retrieved 2026-10-08)

Canonical URL: https://4ort.xyz/entity/descriptive-complexity-of-infinite-domain-constraint-satisfaction-problems · Last refreshed: