Black-Box and Data-Driven Computation (Q5153503)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7404587

Language	Label	Description	Also known as
English	Black-Box and Data-Driven Computation	scientific article; zbMATH DE number 7404587

Statements

scholarly article

0 references

Black-Box and Data-Driven Computation (English)

0 references

0 references

0 references

0 references

0 references

Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

0 references

publication date

30 September 2021

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-66515-9_6

0 references

Theory of Computational Complexity

0 references

Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question

0 references

Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy

0 references

A note on separating the relativized polynomial time hierarchy by immune sets

0 references

Separating the low and high hierarchies by oracles

0 references

0 references

Parity, circuits, and the polynomial-time hierarchy

0 references

Identifiers

10.1007/978-3-030-66515-9_6

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5153503

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5153503&oldid=36718936"