Fast approximate PCPs for multidimensional bin-packing problems (Q1767978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast approximate PCPs for multidimensional bin-packing problems |
scientific article; zbMATH DE number 2142492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximate PCPs for multidimensional bin-packing problems |
scientific article; zbMATH DE number 2142492 |
Statements
Fast approximate PCPs for multidimensional bin-packing problems (English)
0 references
8 March 2005
0 references
Proof-assisted property testing
0 references
Probabilistically checkable proofs
0 references
Multidimensional bin-packing problems
0 references
Sublinear-time algorithms
0 references
0.91541064
0 references
0.8994515
0 references
0 references
0.89831346
0 references
0.8979725
0 references
0.8973211
0 references
0.8971137
0 references
0.8968247
0 references
0.89619505
0 references
