Robust Geometric Programming is co-NP hard

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Classification: Mathematik

Event: Veröffentlichung

(where): Kaiserslautern

(who): Technische Universität Kaiserslautern, Fachbereich Mathematik

(when): 2014

Creator: Chassein, André
Goerigk, Marc

URN: urn:nbn:de:hbz:386-kluedo-39380

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:53 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Chassein, André
Goerigk, Marc
Technische Universität Kaiserslautern, Fachbereich Mathematik

Time of origin

2014

Other Objects (12)

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Arbeitspapier

The Scope of Geometric Programming

Arbeitspapier

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Arbeitspapier

Traffic Equilibria Analysed Via Geometric Programming

Arbeitspapier

Optimality Conditions in Generalized Geometric Programming

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Arbeitspapier

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Arbeitspapier

The Scope of Geometric Programming

Arbeitspapier

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Arbeitspapier

Traffic Equilibria Analysed Via Geometric Programming

Arbeitspapier

Optimality Conditions in Generalized Geometric Programming

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Arbeitspapier

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

zweidimensionales bewegtes Bild

Automating Resolution is NP-Hard

Arbeitspapier

The Scope of Geometric Programming

Arbeitspapier

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Arbeitspapier

Traffic Equilibria Analysed Via Geometric Programming

Arbeitspapier

Optimality Conditions in Generalized Geometric Programming

Hochschulschrift

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Arbeitspapier

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Robust Geometric Programming is co-NP hard

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Automating Resolution is NP-Hard

The Scope of Geometric Programming

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Traffic Equilibria Analysed Via Geometric Programming

Optimality Conditions in Generalized Geometric Programming

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Automating Resolution is NP-Hard

The Scope of Geometric Programming

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Traffic Equilibria Analysed Via Geometric Programming

Optimality Conditions in Generalized Geometric Programming

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Automating Resolution is NP-Hard

The Scope of Geometric Programming

A Handbook of Geometric Programming

Robust Differential Dynamic Programming

Traffic Equilibria Analysed Via Geometric Programming

Optimality Conditions in Generalized Geometric Programming

NP-hard networking problems : exact and approximate algorithms

Leveraging Path Structures in NP-hard Graph Problems

Fenchel's Duality Thereom in Generalized Geometric Programming

Approximating good simultaneous diophantine approximations is almost NP-hard

Deadlock-Detection in Component-Based Systems is NP-hard.

Deciding Liveness in Component-Based Systems is NP-hard

Related objects

Reset password