On the Complexity of Partial Order Productions

DOI10.1137/0218047zbMATH Open0678.68048OpenAlexW2065949117MaRDI QIDQ3835027

Andrew Chi-Chih Yao

Publication date: 1989

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0218047

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Remarks on ‘equivalence of stability concepts for discrete time-varying systems’ ⋮ A Necessary and Sufficient Condition for Chomsky-Productions Over Partially Ordered Symbol Sets ⋮ Finding a mediocre player ⋮ On Generalized Comparison-Based Sorting Problems ⋮ Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks

This page was built for publication: On the Complexity of Partial Order Productions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3835027)