The following pages link to (Q4938414):
Displaying 7 items.
- Design of supervisors for linear marking specifications in labeled Petri nets (Q2063788) (← links)
- On the complexity of Hilbert refutations for partition (Q2252121) (← links)
- Algorithms for solving systems of linear Diophantine equations in integer domains (Q2371668) (← links)
- Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
- On computing Hilbert bases via the Elliot--MacMahon algorithm (Q5941500) (← links)
- On the complexity of recognizing the Hilbert basis of a linear Diophantine system (Q5958323) (← links)
- Algorithms for constructing minimal generating set of solutions for systems of linear equations (Q6547249) (← links)
