Comparator circuits over finite bounded posets

DOI10.1016/j.ic.2018.02.002zbMath1394.68155arXiv1503.00275OpenAlexW3023000450MaRDI QIDQ1640992

Balagopal Komarath, K. S. Sunil, M. N. Jayalal Sarma

Publication date: 14 June 2018

Published in: Information and Computation, Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.00275

zbMATH Keywords

polynomial-size circuitscomparator circuitslogspace computation

Mathematics Subject Classification ID

Partial orders, general (06A06) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Algorithms and lower bounds for comparator circuits from shrinkage

Cites Work

• Unnamed Item
• Unnamed Item
• Every finite lattice can be embedded in a finite partition lattice
• The complexity of circuit value and network stability
• The complexity of the comparator circuit value problem
• Computational Complexity

This page was built for publication: Comparator circuits over finite bounded posets