<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-21T08:50:10Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25721" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25721</identifier><datestamp>2026-09-24T19:27:28Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Valeriote, Matthew</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Rooney, J P</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Mathematics and Statistics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-08-24T17:54:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-08-24T17:54:21Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/25721</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/11613</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis we derive novel results on the complexity of idempotent Mal'tsev condition satisfaction problems. For a Mal'tsev condition M, the idempotent M- satisfaction problem is the decision problem defined via: INPUT: A finite idempotent algebra A. QUESTION: Does A satisfy M? In particular we are able to prove that this decision problem is in the complexity class NP whenever M satisfi es one of the following conditions: 1. M is a strong Mal'tsev condition which implies the existence of a near unanimity term. 2. M is a strong Mal'tsev condition of height &lt; 1 (see Definition 5.1.1). As a porism of these two results, we are able to derive the stronger result that the complexity of the idempotent M-satisfaction problem is in NP whenever M is a strong Mal'tsev condition which implies the existence of an edge term. On top of this we also outline a polynomial-time algorithm for the idempotent M-satisfaction problem when M is a linear strong Mal'tsev condition which implies the existence of a near unanimity term. We also examine the related search problem in which the goal is to produce operation tables of term operations of the algebra A which witness that A satisfies the Mal'tsev condition M whenever such terms exist (and otherwise correctly decide that such terms do not exist). We outline polynomial-time algorithms for this search problem for various strong Mal'tsev conditions. We close the thesis with a short list of open problems as suggested directions for further research.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Universal Algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">General Algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Mal'tsev Conditions</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Mal'tsev Condition Satisfaction Problems</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">MCSP</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Complexity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Algebra</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Constraint Satisfaction</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">CSP</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">On the Complexity of Several Mal'tsev Condition Satisfaction Problems</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Mal'tsev Condition Satisfaction Problems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>