5 results
Search Results
2. SHARPER COMPLEXITY BOUNDS FOR ZERO-DIMENSIONAL GRÖBNER BASES AND POLYNOMIAL SYSTEM SOLVING.
3. ALGORITHM OF ε-SVR BASED ON A LARGE-SCALE SAMPLE SET:: STEP-BY-STEP SEARCH.
4. COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS.
5. REDUCING THE TIME COMPLEXITY OF THE N-QUEENS PROBLEM.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.