Found 6 Documents (Results 1–6)
Complexity issues for preorders on finite labeled forests. (English) Zbl 1344.68096
Löwe, Benedikt (ed.) et al., Models of computation in context. 7th conference on computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 – July 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21874-3/pbk). Lecture Notes in Computer Science 6735, 112-121 (2011).
The Boolean hierarchy of NP-partitions. (English) Zbl 1146.68375
MSC:
68Q15
Labeled posets are universal. (English) Zbl 1133.06003
Reviewer: Marius Tarnauceanu (Iaşi)
MSC:
06A07
Filter Results by …
Document Type
- Journal Articles (5)
- Collection Articles (1)
all
top 5
Author
- Lehtonen, Erkko (3)
- Selivanov, Viktor L’vovich (2)
- Hertling, Peter H. (1)
- Kosub, Sven (1)
- Kwuida, Léonard (1)
- Wagner, Klaus W. (1)
Serial
- Order (2)
- Eur. J. Comb. (1)
- Ann. Pure Appl. Logic (1)
- Inf. Comput. (1)