On the irreducibility of a truncated binomial expansion
Abstract is not available in full text.
Saved in:
Main Authors: | Filaseta, Michael., Kumchev, Angel., Pasechnik, Dmitrii V. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2011
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/93786 http://hdl.handle.net/10220/6786 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial
by: Kaminski, Michael, et al.
Published: (2013) -
Polynomial-time computing over quadratic maps I : sampling in real algebraic sets
by: Grigoriev, Dima., et al.
Published: (2011) -
Computing the nucleolus of weighted voting games
by: Pasechnik, Dmitrii V., et al.
Published: (2011) -
Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011) -
A characterization of the Petersen-type geometry of the McLaughlin group
by: Baumeister, Barbara, et al.
Published: (2011)