Cyclic Extensions of Order Varieties

DOI10.1016/j.entcs.2008.04.057zbMath1286.06004OpenAlexW2093423502MaRDI QIDQ5415613

Pierre Ille, Paul Ruet

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

zbMATH Keywords

computational complexitylogarithmic spacecyclic ordersdimension-2 orders

Mathematics Subject Classification ID

Partial orders, general (06A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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

This page was built for publication: Cyclic Extensions of Order Varieties