Endpoints of associated intervals for local clones on an infinite set

Romov, B. A.

doi:10.1007/s00012-018-0561-5

Algebra Univers.

2018

DOI: 10.1007/s00012-018-0561-5

|View full text |Cite

Endpoints of associated intervals for local clones on an infinite set

B. A. Romov

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs

Jönsson

Lagerkvist

2022

Algorithmica

View full text Add to dashboard Cite

We study the fine-grained complexity of NP-complete, infinite-domain constraint satisfaction problems (CSPs) parameterised by a set of first-order definable relations (with equality). Such CSPs are of central importance since they form a subclass of any infinite-domain CSP parameterised by a set of first-order definable relations over a relational structure (possibly containing more than just equality). We prove that under the randomised exponential-time hypothesis it is not possible to find $$c > 1$$ c > 1 such that a CSP over an arbitrary finite equality language is solvable in $$O(c^n)$$ O ( c n ) time (n is the number of variables). Stronger lower bounds are possible for infinite equality languages where we rule out the existence of $$2^{o(n \log n)}$$ 2 o ( n log n ) time algorithms; a lower bound which also extends to satisfiability modulo theories solving for an arbitrary background theory. Despite these lower bounds we prove that for each $$c > 1$$ c > 1 there exists an NP-hard equality CSP solvable in $$O(c^n)$$ O ( c n ) time. Lower bounds like these immediately ask for closely matching upper bounds, and we prove that a CSP over a finite equality language is always solvable in $$O(c^n)$$ O ( c n ) time for a fixed c, and manage to extend this algorithm to the much broader class of CSPs where constraints are formed by first-order formulas over a unary structure.

show abstract

General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs

Jönsson

Lagerkvist

2022

Algorithmica

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Endpoints of associated intervals for local clones on an infinite set

Cited by 1 publication

References 9 publications

General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs

General Lower Bounds and Improved Algorithms for Infinite–Domain CSPs

Contact Info

Product

Resources

About