One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics (Q5423025): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1162/neco.2007.19.2.546 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087186354 / rank | |||
Normal rank | |||
Revision as of 02:29, 20 March 2024
scientific article; zbMATH DE number 5206625
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics |
scientific article; zbMATH DE number 5206625 |
Statements
One-Bit-Matching Theorem for ICA, Convex-Concave Programming on Polyhedral Set, and Distribution Approximation for Combinatorics (English)
0 references
30 October 2007
0 references
