COMPUTATIONAL-COMPLEXITY OF THE PROBLEM OF CHOOSING EXCHANGE ALTERNATIVES WITH A LIMITED NUMBER OF INDIVISIBLE RESOURCES

被引：0

|

作者：

TEMKIN, VM

机构：

来源：

AUTOMATION AND REMOTE CONTROL | 1983年 / 44卷 / 08期

关键词：

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：1090 / 1095

页数：6

相关论文

共 26 条

[21] Analysis of the impact of the number of edges in connected graphs on the computational complexity of the independent set problem
Malyshev D.S.
Journal of Applied and Industrial Mathematics, 2012, 6 (1) : 97 - 99
[22] ON THE COMPUTATIONAL-COMPLEXITY AND GEOMETRY OF THE 1ST-ORDER THEORY OF THE REALS .2. THE GENERAL DECISION PROBLEM - PRELIMINARIES FOR QUANTIFIER ELIMINATION
RENEGAR, J
JOURNAL OF SYMBOLIC COMPUTATION, 1992, 13 (03) : 301 - 327
[23] A LINEAR TRANSFORMATION TO REDUCE COMPUTATIONAL COMPLEXITY FOR CIRCUITS CONTAINING A LIMITED NUMBER OF NONLINEAR AND TIME-VARIANT ELEMENTS
PARKIN, RE
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1970, CT17 (02): : 277 - &
[24] MUCH ADO ABOUT NOTHING - THE RELATION AMONG COMPUTATIONAL SKILL, ARITHMETIC WORD PROBLEM COMPREHENSION, AND LIMITED ATTENTIONAL RESOURCES
RABINOWITZ, M
WOOLLEY, KE
COGNITION AND INSTRUCTION, 1995, 13 (01) : 51 - 71
[25] ON THE COMPUTATIONAL-COMPLEXITY AND GEOMETRY OF THE 1ST-ORDER THEORY OF THE REALS .1. INTRODUCTION - PRELIMINARIES - THE GEOMETRY OF SEMI-ALGEBRAIC SETS - THE DECISION PROBLEM FOR THE EXISTENTIAL THEORY OF THE REALS
RENEGAR, J
JOURNAL OF SYMBOLIC COMPUTATION, 1992, 13 (03) : 255 - 299
[26] Computational Complexity of the Problem of Choosing Typical Representatives in a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\boldsymbol 2$$\end{document} -Clustering of a Finite Set of Points in a Metric Space
I. A. Borisova
Journal of Applied and Industrial Mathematics, 2020, 14 (2) : 242 - 248