The following pages link to Nikolai Yu. Zolotykh (Q343723):
Displaying 22 items.
- On the number of irreducible points in polyhedra (Q343724) (← links)
- On the complexity of deciphering the threshold functions of \(k\)-valued logic (Q1594168) (← links)
- (Q1801038) (redirect page) (← links)
- Linear read-once and related Boolean functions (Q1801039) (← links)
- On Boolean threshold functions with minimum specification number (Q2105416) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- A dynamic algorithm for constructing the dual representation of a polyhedral cone (Q2181743) (← links)
- Two variations of graph test in double description method (Q2322740) (← links)
- Fast method for verifying Chernikov rules in Fourier-Motzkin elimination (Q2354428) (← links)
- (Q3364531) (← links)
- On the Minimal Teaching Sets of Two-Dimensional Threshold Functions (Q3453571) (← links)
- (Q4247002) (← links)
- Specifying a positive threshold function via extremal points (Q4645645) (← links)
- (Q4888930) (← links)
- (Q4949281) (← links)
- On the Proximity of the Optimal Values of the Multi-dimensional Knapsack Problem with and Without the Cardinality Constraint (Q4965095) (← links)
- ON THE DYNAMIC PROBLEM OF COMPUTING GENERATORS OF A POLYHEDRAL CONE (Q5374529) (← links)
- Accelerating Fourier–Motzkin elimination using bit pattern trees (Q5865333) (← links)
- Estimating the complexity of deciphering a threshold functions in a \(k\)-valued logic (Q5932894) (← links)
- Linear and Fisher Separability of Random Points in the d-dimensional Spherical Layer (Q6334103) (← links)
- Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems (Q6507712) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
