# Universal Algebra Seminar

Thursday, March 17, 2016 — 2:30 PM EDT

Matt Valeriote, McMaster University

“Testability”

I will discuss a question dealing with the solutions of primitive positive (pp) formulas over finite structures. The question is concerned with the query complexity of algorithms for making decisions about the correctness of a proposed solution to a pp-formula over a finite structure. In general, in order to determine with high probability whether some hidden proposed solution to a pp-formula is close to being an actual solution, one will need to check a large fraction of its values. It turns out that for some (special) structures, there are algorithms that only need to check (or query) a constant number of values of a proposed solution to a pp-formula (no matter how many free variables the formula has) in order to conclude, with high probability, whether or not it is close to a solution to the formula over the structure.

With Chen and Yoshida, we characterize, for finite structures A, the query complexity of testing solutions of pp-formulas over A in terms of algebraic conditions on A. In particular, we characterize those structures A for which solution testing can be carried out by an algorithm that only needs to make a constant number of queries of a proposed solution to a pp-formula, independent of the number of free variables the formula has.

MC 5403

### June 2023

S M T W T F S
28
29
30
31
2
3
4
5
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
1. 2023 (174)
1. June (7)
2. May (35)
3. April (21)
4. March (51)
5. February (33)
6. January (27)
2. 2022 (179)
1. December (8)
2. November (31)
3. October (24)
4. September (17)
5. August (9)
6. July (15)
7. June (14)
8. May (13)
9. April (14)
10. March (15)
11. February (12)
12. January (7)
3. 2021 (135)
4. 2020 (103)
5. 2019 (199)
6. 2018 (212)
7. 2017 (281)
8. 2016 (335)
9. 2015 (211)
10. 2014 (235)
11. 2013 (251)
12. 2012 (135)