Sciweavers

664 search results - page 9 / 133
» Some results for a class of generalized polynomials
Sort
View
DGCI
2008
Springer
13 years 9 months ago
About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
In this paper we prove that the function giving the frequency of a class of patterns of digital planes with respect to the slopes of the plane is continuous and piecewise affine, m...
Alain Daurat, Mohamed Tajine, Mahdi Zouaoui
COLT
2000
Springer
13 years 11 months ago
Average-Case Complexity of Learning Polynomials
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
Frank Stephan, Thomas Zeugmann
DM
2010
77views more  DM 2010»
13 years 7 months ago
Hall-Littlewood polynomials and fixed point enumeration
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
Brendon Rhoades
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
13 years 12 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
LICS
2007
IEEE
14 years 1 months ago
Separating DAG-Like and Tree-Like Proof Systems
We show that tree-like (Gentzen’s calculus) PK where all cut formulas have depth at most a constant d does not simulate cut-free PK. Generally, we exhibit a family of sequents t...
Phuong Nguyen