Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms

Artificial Intelligence 296 (C):103505 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Invitation to fixed-parameter algorithms.Rolf Niedermeier - 2006 - New York: Oxford University Press.
Reid, Hardness and Developmental Psychology.Adam Gur Arye - 2014 - Journal of Scottish Philosophy 12 (2):145-162.
An algorithm for the decomposition of finite languages.W. Wieczorek - 2010 - Logic Journal of the IGPL 18 (3):355-366.
Reid, Hardness and Developmental Psychology.Adam Weiler Gur Arye - 2014 - Journal of Scottish Philosophy 12 (2):145-162.
A classification of weakly acyclic games.Krzysztof R. Apt & Sunil Simon - 2015 - Theory and Decision 78 (4):501-524.
Canonical partition relations.James E. Baumgartner - 1975 - Journal of Symbolic Logic 40 (4):541-554.
How to think about algorithms.Jeff Edmonds - 2008 - New York: Cambridge University Press.
Parameterized partition relations on the real numbers.Joan Bagaria & Carlos A. Di Prisco - 2009 - Archive for Mathematical Logic 48 (2):201-226.
Some Results in the Partition Calculus.Albin Lee Jones - 1999 - Dissertation, Dartmouth College
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.

Analytics

Added to PP
2021-04-16

Downloads
12 (#1,079,336)

6 months
2 (#1,187,206)

Historical graph of downloads
How can I increase my downloads?