AI Chat AI Image Generator AI Video Text to Speech

Polytime reductions of AF-algebraic problems

04/28/2021

∙

by Daniele Mundici, et al.

∙

∙

We assess the computational complexity of several decision problems concerning (Murray-von Neumann) equivalence classes of projections of AF-algebras whose Elliott classifier is lattice-ordered. We construct polytime reductions among many of these problems.

page 1

page 2

page 3

page 4

research

∙ 11/19/2017

Verification of PCP-Related Computational Reductions in Coq

We formally verify several computational reductions concerning the Post ...

0 Yannick Forster, et al. ∙

research

∙ 12/22/2022

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

The complexity class NP of decision problems that can be solved nondeter...

0 Hans-Jörg Kreowski, et al. ∙

research

∙ 02/14/2021

A note on VNP-completeness and border complexity

In 1979 Valiant introduced the complexity class VNP of p-definable famil...

0 Christian Ikenmeyer, et al. ∙

research

∙ 10/12/2019

Complexity of the universal theory of bounded residuated distributive lattice-ordered groupoids

We prove that the universal theory and the quasi-equational theory of bo...

0 Dmitry Shkatov, et al. ∙

research

∙ 11/03/2017

Word problems in Elliott monoids

Algorithmic issues concerning Elliott local semigroups are seldom consid...

0 Daniele Mundici, et al. ∙

research

∙ 07/10/2018

Effects of Some Lattice Reductions on the Success Probability of the Zero-Forcing Decoder

Zero-forcing (ZF) decoder is a commonly used approximation solution of t...

0 Jinming Wen, et al. ∙

research

∙ 01/23/2023

Verified reductions for optimization

Numerical and symbolic methods for optimization are used extensively in ...

0 Alexander Bentkamp, et al. ∙