The strongest model of computation obeying 0-1 Principles
type: Item
instance of: scholarly article
title: The strongest model of computation obeying 0-1 Principles
zbMATH Open document ID: 1209.68252
author: Tamir Levi
author: Ami Litman
published in: Theory of Computing Systems
publication date: 2011-03-30T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5871616
zbMATH Keywords: zero-one principle
zbMATH Keywords: comparator networks
zbMATH Keywords: sorting networks
zbMATH Keywords: min max networks
zbMATH Keywords: oblivious algorithms
MaRDI profile type: Publication
OpenAlex ID: W1994493843
cites work: On Dedekind's Problem: The Number of Monotone Boolean Functions
cites work: Q4349924
cites work: K-way bitonic sort
cites work: The asymptotic complexity of merging networks
cites work: Q4385519
DOI: 10.1007/S00224-010-9257-8
description: scientific article; zbMATH DE number 5871616