Cyclic Extensions of Order Varieties
From MaRDI portal
Publication:5415613
DOI10.1016/j.entcs.2008.04.057zbMath1286.06004MaRDI QIDQ5415613
Publication date: 13 May 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.057
06A06: Partial orders, general
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Une théorie combinatoire des séries formelles
- Symmetric space-bounded computation
- Cyclic ordering is NP-complete
- Non-commutative logic. III: Focusing proofs.
- Non-commutative logic. I: The multiplicative fragment
- Non-commutative proof construction: a constraint-based approach
- The Mathematics of Sentence Structure
- Undirected ST-connectivity in log-space
- Cyclically ordered sets
- Partial and complete cyclic orders
- Non-commutative logic II: sequent calculus and phase semantics
- A compendium of problems complete for symmetric logarithmic space