The following pages link to Nina Narodytska (Q464614):
Displaying 20 items.
- Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules (Q464615) (← links)
- The weighted grammar constraint (Q545550) (← links)
- Constrained image generation using binarized neural networks with decision procedures (Q1656604) (← links)
- A SAT-based approach to learn explainable decision sets (Q1799125) (← links)
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable (Q1939255) (← links)
- Assessing heuristic machine learning explanations with model counting (Q2181938) (← links)
- Three generalizations of the FOCUS constraint (Q2398512) (← links)
- The Complexity of Integer Bound Propagation (Q2996913) (← links)
- The AllDifferent Constraint with Precedences (Q3003273) (← links)
- Cores in Core Based MaxSat Algorithms: An Analysis (Q3192051) (← links)
- (Q3455590) (← links)
- Encodings of the Sequence Constraint (Q3523058) (← links)
- Reformulating Global Grammar Constraints (Q3630157) (← links)
- An Adaptive Model Restarts Heuristic (Q4922927) (← links)
- Combining Symmetry Breaking and Global Constraints (Q5191408) (← links)
- (Q5283030) (← links)
- The Weighted Cfg Constraint (Q5387640) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)
- Learning constraints through partial queries (Q6161490) (← links)
- Corrigendum to: ``Learning constraints through partial queries'' (Q6494359) (← links)
