1,194 research outputs found
The number of clones determined by disjunctions of unary relations
We consider finitary relations (also known as crosses) that are definable via
finite disjunctions of unary relations, i.e. subsets, taken from a fixed finite
parameter set . We prove that whenever contains at least one
non-empty relation distinct from the full carrier set, there is a countably
infinite number of polymorphism clones determined by relations that are
disjunctively definable from . Finally, we extend our result to
finitely related polymorphism clones and countably infinite sets .Comment: manuscript to be published in Theory of Computing System
Fast counting with tensor networks
We introduce tensor network contraction algorithms for counting satisfying
assignments of constraint satisfaction problems (#CSPs). We represent each
arbitrary #CSP formula as a tensor network, whose full contraction yields the
number of satisfying assignments of that formula, and use graph theoretical
methods to determine favorable orders of contraction. We employ our heuristics
for the solution of #P-hard counting boolean satisfiability (#SAT) problems,
namely monotone #1-in-3SAT and #Cubic-Vertex-Cover, and find that they
outperform state-of-the-art solvers by a significant margin.Comment: v2: added results for monotone #1-in-3SAT; published versio
Limitations of Algebraic Approaches to Graph Isomorphism Testing
We investigate the power of graph isomorphism algorithms based on algebraic
reasoning techniques like Gr\"obner basis computation. The idea of these
algorithms is to encode two graphs into a system of equations that are
satisfiable if and only if if the graphs are isomorphic, and then to (try to)
decide satisfiability of the system using, for example, the Gr\"obner basis
algorithm. In some cases this can be done in polynomial time, in particular, if
the equations admit a bounded degree refutation in an algebraic proof systems
such as Nullstellensatz or polynomial calculus. We prove linear lower bounds on
the polynomial calculus degree over all fields of characteristic different from
2 and also linear lower bounds for the degree of Positivstellensatz calculus
derivations.
We compare this approach to recently studied linear and semidefinite
programming approaches to isomorphism testing, which are known to be related to
the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the
power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system
that lies between degree-k Nullstellensatz and degree-k polynomial calculus
Process evaluation of five integrated offender management pioneer areas
A qualitative process evaluation of five Integrated Offender Management (IOM) pioneer areas was undertaken to assess implementation of IOM, identify approaches to implementation and capture the lessons learnt. The findings indicated that IOM enabled structural changes, transforming the delivery of offender management. There was considerable commitment and enthusiasm for IOM at the sites, whilst acknowledging barriers to development such as definition, resourcing, governance and clarity of agency roles. Since the evaluation took place, the political and criminal justice landscape has changed somewhat, supporting a more locally driven approach which can draw on the learning directly from the pioneers which were shaped and delivered locally
- …