Search

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

Search tips:

  • Search terms are case-insensitive
  • Common words are ignored
  • By default only articles containing all terms in the query are returned (i.e., AND is implied)
  • Combine multiple words with OR to find articles containing either term; e.g., education OR research
  • Use parentheses to create more complex queries; e.g., archive ((journal OR conference) NOT theses)
  • Search for an exact phrase by putting it in quotes; e.g., "open access publishing"
  • Exclude a word by prefixing it with - or NOT; e.g. online -politics or online NOT politics
  • Use * in a term as a wildcard to match any sequence of characters; e.g., soci* morality would match documents containing "sociological" or "societal"

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies