Sciweavers

787 search results - page 20 / 158
» Polynomial Constants are Decidable
Sort
View
MOC
1998
92views more  MOC 1998»
13 years 7 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...
DISOPT
2008
89views more  DISOPT 2008»
13 years 8 months ago
Complexity of the min-max (regret) versions of min cut problems
This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
14 years 8 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
FOCS
1989
IEEE
14 years 1 days ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
SIAMCOMP
2002
98views more  SIAMCOMP 2002»
13 years 7 months ago
Self-Stabilizing Symmetry Breaking in Constant Space
abstract Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring...
Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti...