A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Kernelization of Constraint Satisfaction Problems: A Study through Universal Algebra
[article]

2017
*
arXiv
*
pre-print

We also

arXiv:1706.05941v1
fatcat:3exvyn3oxzf4lioqs5sed6z4da
*study*extensions*of*this towards SAT and CSP*problems*with*kernels*with O(n^c)*constraints*, c>1, based on embeddings into CSP*problems*preserved by*a*k-edge operation, k > c. ... For the Boolean satisfiability*problem*(SAT), and the*constraint**satisfaction**problem*(CSP), there exist many results concerning upper and lower bounds for kernelizability*of*specific*problems*, but it ... The*Constraint**Satisfaction**Problem**A*set*of*relations Γ is referred to as*a**constraint*language. ...##
###
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra
[chapter]

2017
*
Lecture Notes in Computer Science
*

We also

doi:10.1007/978-3-319-66158-2_11
fatcat:jbbgfbzzn5fodeao3ponbspgz4
*study*extensions*of*this towards SAT and CSP*problems*with*kernels*with O(n c )*constraints*, c > 1, based on embeddings into CSP*problems*preserved by*a*k-edge operation, k ≤ c + 1. ... For the Boolean satisfiability*problem*(SAT), and the*constraint**satisfaction**problem*(CSP), there exist many results concerning upper and lower bounds for kernelizability*of*specific*problems*, but it ... The*Constraint**Satisfaction**Problem**A*set*of*relations Γ is referred to as*a**constraint*language. ...##
###
Universal Algebraic Methods for Constraint Satisfaction Problems
[article]

2022
*
arXiv
*
pre-print

After substantial progress over the last 15 years, the "

arXiv:1611.02867v9
fatcat:rcb7e4ld2vgrfl55y6xar323sy
*algebraic*CSP-dichotomy conjecture" reduces to the following: every local*constraint**satisfaction**problem*(CSP) associated with*a*finite idempotent ...*algebra*is tractable if and only if the*algebra*has*a*Taylor term operation. ... We give*a*definition*of*"*constraint**satisfaction**problem*" that is convenient for our purposes. ...##
###
Constraint Satisfaction Problems with Infinite Templates
[chapter]

2008
*
Lecture Notes in Computer Science
*

Allowing templates with infinite domains greatly expands the range

doi:10.1007/978-3-540-92800-3_8
fatcat:tzhsee2mkjhy5bk7i5jmpiraee
*of**problems*that can be formulated as*a*non-uniform*constraint**satisfaction**problem*. ... We then give an introduction to the*universal*-*algebraic*approach to infinite-domain*constraint**satisfaction*, and discuss how cores, polymorphism clones, and pseudovarieties can be used to*study*the computational ... One*of*the most basic temporal reasoning*problems*is the*constraint**satisfaction**problem**of*the socalled point*algebra*. ...##
###
On the Computational Complexity of Monotone Constraint Satisfaction Problems
[chapter]

2009
*
Lecture Notes in Computer Science
*

J = {(x, y, z, w) ∈ D 4 | (x = y) ∨ (z = w)} in

doi:10.1007/978-3-642-00202-1_25
fatcat:oa42nfcj6nbgpdnjbgbzwdrlea
*a*classical*constraint**satisfaction**problem*reduces it to*a*monotone*constraint**satisfaction**problem*. Proposition 2. ...*Constraint**Satisfaction**Problems*(CSP) constitute*a*convenient way to capture many combinatorial*problems*. ... We will*study*monotone*constraint**satisfaction**problems*MCSP(S)*through*sets*of*functions F satisfying Inv F = S. ...##
###
A Constraint Satisfaction Problem Algorithm for Certain 2-Semilattice-over-Edge Algebras
[article]

2016
*
arXiv
*
pre-print

In [8], the so called "

arXiv:1609.03943v1
fatcat:n2owoy6ynbhonmjtidftczmadu
*algebraic*approach" to the*constraint**satisfaction**problem*was established. ... To any fixed, finite relational structure, D, there is an associated decision*problem*, CSP(D), which is*a*restricted version*of*the*constraint**satisfaction**problem*. ...*Constraint**satisfaction**problems*In this section, we will give precise definitions regarding*constraint**satisfaction**problems*. Three versions*of*CSP. ...##
###
The Hidden Subgroup Problem for Universal Algebras
[article]

2020
*
arXiv
*
pre-print

We propose

arXiv:2001.11298v1
fatcat:m3oxykxz5reorjugfqhxrn7uku
*a*generalization*of*the HSP to include arbitrary*algebraic*structures and analyze this new*problem*on powers*of*2-element*algebras*. ... In particular, we identify*a*class*of**algebras*for which the generalized HSP exhibits super-polynomial speedup on*a*quantum computer compared to*a*classical one. ... The*study**of*cube terms originated with*algebraic*approach to the*Constraint**Satisfaction**Problem*(CSP) in [2] , and the existence*of**a*cube term for*A*is associated with some quite strong regularity ...##
###
Robust satisfiability of constraint satisfaction problems

2012
*
Proceedings of the 44th symposium on Theory of Computing - STOC '12
*

An algorithm for

doi:10.1145/2213977.2214061
dblp:conf/stoc/BartoK12
fatcat:xt7isv333fg3fdjuyoygy2udw4
*a**constraint**satisfaction**problem*is called robust if it outputs an assignment satisfying at least (1 − g(ε))-fraction*of*the*constraints*given*a*(1 − ε)-satisfiable instance, where g( ... Guruswami and Zhou conjectured*a*characterization*of**constraint*languages for which the corresponding*constraint**satisfaction**problem*admits an efficient robust algorithm. ...*Universal**algebra*and hardness results for*constraint**satisfaction**problems*. Theor. Comput. Sci., 410:1629-1647, April 2009.[24] Benoit Larose and László Zádori. ...##
###
Towards a dichotomy theorem for the counting constraint satisfaction problem

2007
*
Information and Computation
*

The counting

doi:10.1016/j.ic.2006.09.005
fatcat:y6qh7are4fgapekyoiiimduu5q
*constraint**satisfaction**problem*(#CSP) can be expressed as follows: given*a*set*of*variables,*a*set*of*values that can be taken by the variables, and*a*set*of**constraints*specifying some restrictions ... This*problem*can be parametrized by the set*of*relations that may appear in*a**constraint*. In this paper we start*a*systematic*study**of*subclasses*of*the #CSP restricted in this way. ... in the*study**of*the decision*constraint**satisfaction**problem*[9, 10, 34, 36] . ...##
###
Worst-Case Risk Quantification under Distributional Ambiguity using Kernel Mean Embedding in Moment Problem
[article]

2020
*
arXiv
*
pre-print

Specifically, we formulate the generalized moment

arXiv:2004.00166v2
fatcat:2icto7waavazrjpawjgtgtaiuu
*problem*whose ambiguity set (i.e., the moment*constraint*) is described by*constraints*in the associated reproducing*kernel*Hilbert space in*a*nonparametric ... As*a*concrete application, we numerically test the proposed method in characterizing the worst-case*constraint*violation probability in the context*of**a*constrained stochastic control system. ... Since the embedding is injective if φ is associated with*a**universal**kernel*, the conclusion follows. B. Proof*of*Lemma 2 Proof. ...##
###
Commutative idempotent groupoids and the constraint satisfaction problem

2015
*
Algebra Universalis
*

for the

doi:10.1007/s00012-015-0323-6
fatcat:acdbzdlolfd6zoouqlg2ji67xi
*constraint**satisfaction**problem*over finite*algebras*from the varieties they define. ... It is tacitly assumed that every instance*of**a**constraint**satisfaction**problem*can be encoded as*a*finite binary string. ...##
###
A finer reduction of constraint problems to digraphs

2015
*
Logical Methods in Computer Science
*

We present

doi:10.2168/lmcs-11(4:18)2015
fatcat:mcinbnpmebfnvdjqv2bpmrmhdu
*a*variant*of*this construction and show that the corresponding*constraint**satisfaction**problem*is logspace equivalent to that over*A*. ... It is well known that the*constraint**satisfaction**problem*over*a*general relational structure*A*is polynomial time equivalent to the*constraint**problem*over some associated digraph. ... number*of*technical issues. ...##
###
Generalized counting constraint satisfaction problems with determinantal circuits

2015
*
Linear Algebra and its Applications
*

Generalized counting

doi:10.1016/j.laa.2014.09.050
fatcat:iytkul4pmfatdijarh2klrldba
*constraint**satisfaction**problems*include Holant*problems*with planarity restrictions; polynomial-time algorithms for such*problems*include matchgates and matchcircuits, which are based ... We introduce the counting*problem*in monoidal categories and count-preserving functors as*a*way to*study*FP subclasses*of**problems*in settings which are generally #P-hard. ... P-hard (examples include weighted counting*constraint**satisfaction**problems*[4] ). ...##
###
The Graph Isomorphism Problem (Dagstuhl Seminar 15511)

2016
*
Dagstuhl Reports
*

*A*highlight

*of*the conference was the presentation

*of*

*a*new quasi-polynomial time algorithm for the Graph Isomorphism

*Problem*, providing the first improvement since 1983. ... This report documents the program and the outcomes

*of*Dagstuhl Seminar 15511 "The Graph Isomorphism

*Problem*". ... On Tinhofer's Linear Programming Approach to Isomorphism Testing Oleg Verbitsky ( Exploring

*a*linear programming approach to Graph Isomorphism, Tinhofer [1] defined the concept

*of*

*a*compact graph:

*A*graph ...

##
###
Complexity of conservative constraint satisfaction problems

2011
*
ACM Transactions on Computational Logic
*

In

doi:10.1145/1970398.1970400
fatcat:ngcdqhu4vvg43pib6jm3p3gpwa
*a**constraint**satisfaction**problem*(CSP) the aim is to find an assignment*of*values to*a*given set*of*variables, subject to specified*constraints*. The CSP is known to be NP-complete in general. ... Restrictions*of*this type can be*studied*by considering those*constraint*languages which contain all possible unary*constraints*; we call such languages conservative. ...*Constraint**satisfaction**problems*related to some particular types*of*conservative*constraint*languages have already been*studied*. ...
« Previous

*Showing results 1 — 15 out of 1,815 results*