guest ::
000133645 001__ 133645 000133645 005__ 20240719124638.0 000133645 0247_ $$2ISSN$$a0025-5610 000133645 0247_ $$2ISSN$$a1436-4646 000133645 0247_ $$2WOS$$aWOS:000251372500007 000133645 0247_ $$2DOI$$a10.1007/s10107-006-0042-z 000133645 0247_ $$2HSB$$a9910007554 000133645 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-36749062004 000133645 037__ $$aRWTH-CONV-014701 000133645 041__ $$aEnglish 000133645 1001_ $$0P:(DE-82)IDM00960$$aNaumann, Uwe$$b0$$eAuthor$$urwth 000133645 245__ $$aOptimal Jacobian accumulation is NP-complete$$honline, print 000133645 260__ $$aBerlin ; Heidelberg$$bSpringer$$c2008 000133645 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal 000133645 3367_ $$2DataCite$$aOutput Types/Journal article 000133645 3367_ $$00$$2EndNote$$aJournal Article 000133645 3367_ $$2BibTeX$$aARTICLE 000133645 3367_ $$2ORCID$$aJOURNAL_ARTICLE 000133645 3367_ $$2DRIVER$$aarticle 000133645 591__ $$aGermany 000133645 653_7 $$2eng$$aautomatic differentiation 000133645 653_7 $$2eng$$acomplexity 000133645 653_7 $$2eng$$aNP-completeness 000133645 773__ $$0PERI:(DE-600)1463397-8$$a10.1007/s10107-006-0042-z$$n2$$p427-441$$tMathematical programming$$v112$$x0025-5610 000133645 909CO $$ooai:publications.rwth-aachen.de:133645$$pVDB 000133645 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article 000133645 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x0 000133645 9201_ $$0I:(DE-82)123120_20140620$$k123120$$lLehr- und Forschungsgebiet Informatik 12 (Software und Werkzeuge für Computational Engineering)$$x1 000133645 961__ $$c2014-12-05$$x2010-05-14$$z2012-02-20 000133645 970__ $$ahsb9910007554 000133645 980__ $$ajournal 000133645 980__ $$aI:(DE-82)120000_20140620 000133645 980__ $$aI:(DE-82)123120_20140620 000133645 980__ $$aVDB 000133645 980__ $$aUNRESTRICTED 000133645 980__ $$aConvertedRecord