DAG reversal is NP-complete
type: Item
instance of: scholarly article
title: DAG reversal is NP-complete
zbMATH Open document ID: 1192.68490
author: Uwe Naumann
published in: Journal of Discrete Algorithms
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5645004
zbMATH Keywords: data-flow reversal
zbMATH Keywords: NP-completeness
zbMATH Keywords: adjoint code
zbMATH Keywords: numerical computer programs
describes a project that uses: TAF
describes a project that uses: CompAD
describes a project that uses: TAPENADE
describes a project that uses: NAGWare
describes a project that uses: MITgcm
MaRDI profile type: Publication
full work available at URL: j.jda.2008.09.008
OpenAlex ID: W2032126554
cites work: Computational differentiation: techniques, applications, and tools
cites work: Q2583680
cites work: Q2778918
cites work: Q4003880
cites work: Q4198056
cites work: Recipes for adjoint code construction
cites work: Q4954403
cites work: Q2844228
cites work: Q2844230
cites work: Optimality-preserving elimination of linearities in Jacobian accumulation
cites work: The Pebbling Problem is Complete in Polynomial Space
DOI: 10.1016/J.JDA.2008.09.008
description: scientific article; zbMATH DE number 5645004