Intractability results in discrete-event simulation (Q4883003)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 894745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intractability results in discrete-event simulation |
scientific article; zbMATH DE number 894745 |
Statements
Intractability results in discrete-event simulation (English)
0 references
7 April 1997
0 references
discrete-event system
0 references
computational complexity
0 references
model building
0 references
strong permutation
0 references
weak permutation
0 references
interrupt
0 references
simulation modeling
0 references
NP-hard
0 references
polynomial Turing reductions
0 references
0.8348608016967773
0 references
0.775078535079956
0 references
0.697429358959198
0 references
0.6952582001686096
0 references
0.6948574781417847
0 references
