scientific article; zbMATH DE number 4041025

zbMATH Open0638.62007MaRDI QIDQ3779569FDOQ3779569

Authors: R. Chandrasekaran, K. P. K. Nair, Santosh N. Kabadi 

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 35455
• scientific article; zbMATH DE number 4078484
• scientific article; zbMATH DE number 4070014
• scientific article; zbMATH DE number 218978
• scientific article; zbMATH DE number 3356083

zbMATH Keywords

NP-hardstrongly polynomial algorithmTuring reductionfixed number of surveysoptimal integration of sampling surveys

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779569)