Nikolai Yu. Zolotykh

From MaRDI portal
Revision as of 19:16, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:343723

Available identifiers

zbMath Open zolotykh.nikolai-yurevichMaRDI QIDQ343723

List of research outcomes





PublicationDate of PublicationType
Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems2024-08-27Paper
Faster Integer Points Counting in Parametric Polyhedra2023-10-20Paper
On Boolean threshold functions with minimum specification number2022-12-08Paper
How to find the convex hull of all integer points in a polyhedron?2022-08-09Paper
Accelerating Fourier–Motzkin elimination using bit pattern trees2022-06-13Paper
On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint2021-02-25Paper
A dynamic algorithm for constructing the dual representation of a polyhedral cone2020-05-19Paper
Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer2020-02-01Paper
Two variations of graph test in double description method2019-09-05Paper
Specifying a positive threshold function via extremal points2019-01-10Paper
Linear read-once and related Boolean functions2018-10-26Paper
ON THE DYNAMIC PROBLEM OF COMPUTING GENERATORS OF A POLYHEDRAL CONE2018-09-14Paper
On the number of irreducible points in polyhedra2016-11-29Paper
On the Minimal Teaching Sets of Two-Dimensional Threshold Functions2015-11-27Paper
Fast method for verifying Chernikov rules in Fourier-Motzkin elimination2015-07-13Paper
Alcuin's Propositiones de Civitatibus: the Earliest Packing Problems2013-08-05Paper
On the number of vertices in integer linear programming problems2006-11-12Paper
Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic2001-06-17Paper
On the complexity of deciphering the threshold functions of \(k\)-valued logic2001-01-28Paper
https://portal.mardi4nfdi.de/entity/Q49492812000-05-08Paper
https://portal.mardi4nfdi.de/entity/Q42470022000-03-13Paper
https://portal.mardi4nfdi.de/entity/Q48889301996-10-30Paper
https://portal.mardi4nfdi.de/entity/Q33645311995-01-01Paper
Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover ProblemsN/APaper

Research outcomes over time

This page was built for person: Nikolai Yu. Zolotykh