//--> //--> //-->
Toggle navigation
Logout
Change account settings
EN
DE
ES
FR
A-Z
Beta
About EconBiz
News
Thesaurus (STW)
Research Skills
Help
EN
DE
ES
FR
My account
Logout
Change account settings
Login
Publications
Events
Your search terms
Search
Retain my current filters
~subject:"Computational Complexity"
Search options
All Fields
Title
Exact title
Subject
Author
Institution
ISBN/ISSN
Published in...
Publisher
Open Access only
Advanced
Search history
My EconBiz
Favorites
Loans
Reservations
Fines
You are here:
Home
Search: subject:"NP-complete"
Narrow search
Delete all filters
| 1 applied filter
Year of publication
From:
To:
Subject
All
Computational Complexity
NP-complete
25
Theorie
19
Theory
16
Mathematical programming
9
Mathematische Optimierung
9
Algorithm
8
Computational complexity
8
Algorithmus
7
NP-complete problems
7
Scheduling problem
7
Scheduling-Verfahren
7
NP-hard
5
Nash equilibrium
5
Nash-Gleichgewicht
5
computational complexity
5
Heuristics
4
NP-Complete
4
Pareto efficiency
4
Combinatorial optimization
3
Heuristik
3
NP complete
3
NP-vollständiges Problem
3
Nichtkooperatives Spiel
3
Noncooperative game
3
additive preferences
3
approximation algorithm
3
coalition formation
3
hedonic games
3
Additive Preferences
2
Algorithms
2
Bottleneck
2
Coalition Formation
2
Complexity Theory
2
Complexity theory
2
Core
2
Durchlaufzeit
2
Dynamic programming
2
Engpass
2
Entscheidungstheorie
2
more ...
less ...
Online availability
All
Free
2
Type of publication
All
Book / Working Paper
2
Type of publication (narrower categories)
All
Working Paper
1
Language
All
English
2
Author
All
Dimitrov, Dinko
2
Sung, Shao-Chin
1
Sung, Shao-chin
1
Institution
All
Fondazione ENI Enrico Mattei (FEEM)
1
Published in...
All
Nota di Lavoro
1
Working Papers / Fondazione ENI Enrico Mattei (FEEM)
1
Source
All
EconStor
1
RePEc
1
Showing
1
-
2
of
2
Sort
relevance
articles prioritized
date (newest first)
date (oldest first)
1
Computational complexity in additive hedonic games
Dimitrov, Dinko
;
Sung, Shao-chin
-
2008
stable coalition structure and of an individually stable coalition structure turn out to be
NP-complete
in the strong sense. …
Persistent link: https://www.econbiz.de/10010279421
Saved in:
2
Computational Complexity in Additive Hedonic Games
Dimitrov, Dinko
;
Sung, Shao-Chin
-
Fondazione ENI Enrico Mattei (FEEM)
-
2008
stable coalition structure and of an individually stable coalition structure turn out to be
NP-complete
in the strong sense. …
Persistent link: https://www.econbiz.de/10005230821
Saved in:
Results per page
10
25
50
100
250
A service of the
zbw
×
Loading...
//-->