The following pages link to Stavros S. Cosmandakis (Q1900922):
Displaying 21 items.
- (Q579955) (redirect page) (← links)
- (Q1603460) (redirect page) (← links)
- Partition semantics for relations (Q579957) (← links)
- (Q696952) (redirect page) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- The word and generator problems for lattices (Q1105626) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- On the orthographic dimension of definable sets (Q1603462) (← links)
- On datalog vs polynomial time (Q1900923) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- Undecidability and intractability results concerning datalog programs and their persistency numbers (Q2946600) (← links)
- The Traveling Salesman Problem with Many Visits to Few Cities (Q3312037) (← links)
- The complexity of evaluating relational queries (Q3334110) (← links)
- (Q3341921) (← links)
- Polynomial-time implication problems for unary inclusion dependencies (Q3476305) (← links)
- (Q3696560) (← links)
- The complexity of the travelling repairman problem (Q3709900) (← links)
- Updates of Relational Views (Q3770002) (← links)
- (Q3972839) (← links)
- (Q4473154) (← links)
- Datalog programs and their persistency numbers (Q5277729) (← links)
- (Q5714262) (← links)
