Pages that link to "Item:Q666411"

From MaRDI portal

← Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411):

Displaying 1 item.

Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q666411"