Comparator circuits over finite bounded posets (Q1640992): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q475334
Normalize DOI.
 
(10 intermediate revisions by 8 users not shown)
aliases / en / 0aliases / en / 0
 
Comparator Circuits over Finite Bounded Posets
description / endescription / en
scientific article
scientific article; zbMATH DE number 6498695
Property / DOI
 
Property / DOI: 10.1016/j.ic.2018.02.002 / rank
Normal rank
 
Property / title
 
Comparator Circuits over Finite Bounded Posets (English)
Property / title: Comparator Circuits over Finite Bounded Posets (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1394.68154 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-47672-7_68 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2018.02.002 / rank
 
Normal rank
Property / author
 
Property / author: M. N. Jayalal Sarma / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
27 October 2015
Timestamp+2015-10-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 27 October 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6498695 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3023000450 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1604820512 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.00275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the comparator circuit value problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of circuit value and network stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite lattice can be embedded in a finite partition lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218274 / rank
 
Normal rank

Latest revision as of 05:16, 28 December 2024

scientific article; zbMATH DE number 6498695
  • Comparator Circuits over Finite Bounded Posets
Language Label Description Also known as
English
Comparator circuits over finite bounded posets
scientific article; zbMATH DE number 6498695
  • Comparator Circuits over Finite Bounded Posets

Statements

Comparator circuits over finite bounded posets (English)
0 references
Comparator Circuits over Finite Bounded Posets (English)
0 references
0 references
0 references
0 references
14 June 2018
0 references
27 October 2015
0 references
comparator circuits
0 references
logspace computation
0 references
polynomial-size circuits
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references