检索

期
标题
作者
卷 13, 编号 3 (2019)
On the Minimization of Boolean Functions for Additive Complexity Measures
Chukhrov I.
PDF
(Eng)
卷 11, 编号 3 (2017)
Computational complexity of the original and extended diophantine Frobenius problem
Fomichev V.
PDF
(Eng)
卷 13, 编号 2 (2019)
On a Construction of Easily Decodable Sub-de Bruijn Arrays
Makarov D., Yashunsky A.
PDF
(Eng)
卷 11, 编号 2 (2017)
Proof of covering minimality by generalizing the notion of independence
Chukhrov I.
PDF
(Eng)
卷 12, 编号 4 (2018)
On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size
Sirotkin D., Malyshev D.
PDF
(Eng)
卷 11, 编号 1 (2017)
Critical elements in combinatorially closed families of graph classes
Malyshev D.
PDF
(Eng)
卷 12, 编号 3 (2018)
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes
Rychkov K.
PDF
(Eng)
卷 13, 编号 4 (2019)
On a Relation Between the Depth and Complexity of Monotone Boolean Formulas
Sergeev I.
PDF
(Eng)
卷 12, 编号 3 (2018)
On the Complexity of Minimizing Quasicyclic Boolean Functions
Chukhrov I.
PDF
(Eng)
卷 13, 编号 4 (2019)
On the Perfectness of Minimal Regular Partitions of the Edge Set of the n-Dimensional Cube
Rychkov K.
PDF
(Eng)
卷 12, 编号 1 (2018)
Rectifier Circuits of Bounded Depth
Sergeev I.
PDF
(Eng)
卷 13, 编号 4 (2019)
Complexity of Cyclic Job Shop Scheduling Problems for Identical Jobs with No-Wait Constraints
Romanova A., Servakh V.
PDF
(Eng)
卷 12, 编号 1 (2018)
On the Complexity of Multivalued Logic Functions over Some Infinite Basis
Kochergin V., Mikhailovich A.
PDF
(Eng)
卷 13, 编号 3 (2019)
A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand
Kononov A., Panin A., Plyasunov A.
PDF
(Eng)
卷 11, 编号 4 (2017)
On computational complexity of the electric power flow optimization problem in market environment
Eremeev A.
PDF
(Eng)
1 - 15 的 15 信息

检索提示:

  • 检索的名词区分大小写
  • 常用字词将被忽略
  • 默认情况下只有在查询结果满足所有检索词才返回（例如，隐含AND）
  • 使用OR结合多个检索词，便于查找含有这些检索词的文章，例如education OR research
  • 使用括号来创建更复杂的查询; 例如：archive ((journal OR conference) NOT theses)
  • 使用引号检索一个完整的词组; 例如： "open access publishing"
  • 使用-或者NOT排除一个检索词; 例如：online -politics or online NOT politics
  • 在检索词里使用 *作为通配符匹配任何字符序列; 例如., soci* morality 将符合含有 "sociological" or "societal"的词语
##common.cookie##