|
821 |
On the Computational Complexity of Best L 1 ‐approximation
Enthalten in Mathematical logic quarterly Bd. 48, 2002, Nr. S1, Mathematical Logic Quarterly/Supplement 1 1: 66-77. 12 S.
|
|
|
|
822 |
On the Computational Complexity of Compressed Power Series
Enthalten in Mathematical notes Bd. 114, 24.8.2023, Nr. 1-2, date:8.2023: 92-98
|
|
|
|
823 |
On the computational complexity of curing non-stoquastic Hamiltonians
Enthalten in Nature Communications Bd. 10, 5.4.2019, Nr. 1, date:12.2019: 1-9
|
|
|
|
824 |
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Enthalten in Theory of computing systems Bd. 66, 11.5.2022, Nr. 3, date:6.2022: 519-545
|
|
|
|
825 |
On the computational complexity of ethics: moral tractability for minds and machines
Enthalten in Artificial intelligence review Bd. 57, 31.3.2024, Nr. 4, date:4.2024: 1-90
|
|
|
|
826 |
On the computational complexity of finding a sparse Wasserstein barycenter
Enthalten in Journal of combinatorial optimization Bd. 41, 3.3.2021, Nr. 3, date:4.2021: 736-761
|
|
|
|
827 |
On the computational complexity of Roman $$\2\}$$ 2 } -domination in grid graphs
Enthalten in Journal of combinatorial optimization Bd. 45, 14.4.2023, Nr. 3, date:4.2023: 1-10
|
|
|
|
828 |
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
Enthalten in Algorithms for molecular biology Bd. 12, 14.3.2017, Nr. 1, date:12.2017: 1-12
|
|
|
|
829 |
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
Enthalten in Algorithmica Bd. 76, 4.2.2016, Nr. 4, date:12.2016: 1181-1202
|
|
|
|
830 |
Preface of the special issue on computational complexity and complex systems
Enthalten in Journal of membrane computing Bd. 5, 7.7.2023, Nr. 3, date:9.2023: 190-192
|
|
Administration
