Parameterized complexity classes defined by threshold circuits and their connection with sorting networks
type: Item
instance of: scholarly article
title: Parameterized complexity classes defined by threshold circuits and their connection with sorting networks
author: Raffael Muralha Paranhos
author: Janio Carlos Nascimento Silva
author: Uéverton dos Santos Souza
published in: International Journal of Foundations of Computer Science
publication date: 2024-09-24T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7918137
zbMATH Keywords: threshold circuits
zbMATH Keywords: AKS network
zbMATH Keywords: parameterized complexity
zbMATH Keywords: W-hierarchy
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: Eigenvalues and expanders
cites work: Computational Complexity
cites work: Q4393480
cites work: W-hierarchies defined by symmetric gates
cites work: Parity, circuits, and the polynomial-time hierarchy
cites work: Threshold circuits of bounded depth
cites work: Ramanujan graphs
cites work: Improved sorting networks with O(log N) depth
cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
cites work: Explicit Concentrators from Generalized N-Gons
DOI: 10.1142/S0129054123410046
description: scientific article; zbMATH DE number 7918137