467 search results - page 41 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
BIRTHDAY
2010
Springer
14 years 9 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
CP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper presents an experimental investigation of the following questions: how does the averagecase complexity of random 3-SAT, understood as a function of the order (...
ICIP
1998
IEEE
16 years 1 months ago
1998
IEEE
A method has beenproposed for blindly estimating the Point Spread Function (PSF) of video data. The PSF's of the images in a sequence are assumed to be of compact support and...