Sciweavers

24 search results - page 1 / 5
» Polynomials with small Mahler measure
Sort
View
MOC
1998
61views more  MOC 1998»
13 years 9 months ago
Polynomials with small Mahler measure
Abstract. We describe several searches for polynomials with integer coefficients and small Mahler measure. We describe the algorithm used to test Mahler measures. We determine all...
Michael J. Mossinghoff
MOC
1998
92views more  MOC 1998»
13 years 9 months ago
Perturbing polynomials with all their roots on the unit circle
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
Michael J. Mossinghoff, Christopher G. Pinner, Jef...
FCT
2009
Springer
14 years 4 months ago
Small-Space Analogues of Valiant's Classes
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
Meena Mahajan, B. V. Raghavendra Rao
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
14 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ECCV
2006
Springer
14 years 11 months ago
A Simple Solution to the Six-Point Two-View Focal-Length Problem
Abstract. This paper presents a simple and practical solution to the 6-point 2view focal-length estimation problem. Based on the hidden-variable technique we have derived a 15th de...
Hongdong Li