Pages that link to "Item:Q5240420"
From MaRDI portal
The following pages link to Counting Solutions to Polynomial Systems via Reductions (Q5240420):
Displaying 8 items.
- Reducing the polynomial-like iterative equations order and a generalized Zoltán Boros' problem (Q329385) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Counting solutions to binomial complete intersections (Q870342) (← links)
- Counting solutions of polynomial systems via iterated fibrations (Q1016493) (← links)
- \#P-completeness of counting roots of a sparse polynomial (Q1628696) (← links)
- A method for counting the number of polynomial equivalence classes (Q2846950) (← links)
- (Q5121894) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)