Hostname: page-component-54dcc4c588-mz6gc Total loading time: 0 Render date: 2025-09-11T11:15:02.607Z Has data issue: false hasContentIssue false
  • English
  • Français

Unbounded visual search is not both biologically plausible and NP - Complete

Review products

Commentary onTsotsosJohn K. (1990). Analyzing vision at the complexity level. BBS 13: 423–469.

Published online by Cambridge University Press:  19 May 2011

Paul R. Kube
Paul R. Kube
Affiliation:
Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA 92093, Electronic mail: kube@cs.ucsd.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Continuing Commentary
Information
Behavioral and Brain Sciences , Volume 14 , Issue 4 , December 1991 , pp. 768 - 770
Copyright
Copyright © Cambridge University Press 1991

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bellman, R. (1954) Some applications of the theory of dynamic programming. Operations Research 2:275–88. [rJKT, PRK]Google Scholar
Dantzig, G. (1957) Discrete-variable extremum problems. Operations Research 5:266–77. [rJKT, PRK]CrossRefGoogle Scholar
Devalois, R. L. & Devalois, K. K.Spatial vision. Oxford University Press. [PRK]Google Scholar
Dowling, J. (1987) The retina. Belknap Press. [PRK]Google Scholar
Garey, M. & Johnson, D. (1979) Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman. [PRK]Google Scholar
Gopalakrishnan, P. S., Ramakrishnan, I. V. – Kanal, L. N. (1991) Approximate algorithms for the Knapsack problem on parallel computers. Information and Computation 91(2):155–71. [rJKT, PRK]CrossRefGoogle Scholar
Kirousis, L. M. & Papadimitriou, C. H. (1985) The complexity of recognizing polyhedral scenes, journal of Computer and System Sciences 37:14–38. [rJKT, PRK]CrossRefGoogle Scholar
Leeper, R. (1935) A study of a neglected portion of the field of learning: The development of sensory organization. Journal of Genetic Psychology 46:41–75. [rJKT]Google Scholar
Peters, J. & Rudolph, L. (1987) Parallel approximation schemes for subset sum and Knapsack problems. Ada Informatica 24:417–32. [rJKT, PRK]CrossRefGoogle Scholar
Rytter, W. (1988) On efficient parallel computations for some dynamic programming problems. Theoretical Computer Science 59:297–307. [JKT]CrossRefGoogle Scholar
Stockmeyer, L. & Chandra, A. (1979) Intrinsically difficult problems. Scientific American, May. [rJKT]CrossRefGoogle Scholar
Teng, S. (1990) Adaptive parallel algorithms for integral knapsack problems. Journal of Parallel and Distributed Computing 8:400–06. [rJKT]CrossRefGoogle Scholar
Tsotsos, J. (1989) The complexity of visual search tasks. Proceedings of the International Joint Conference on Artificial Intelligence, Detroit. [PRK]Google Scholar
Tsotsos, J. (1990t) Analyzing vision at the complexity level. Behavioral and Brain Science 13:423–44. [PRK]CrossRefGoogle Scholar
Tsotsos, J. (1990r) A little complexity analysis goes a long way. Behavioral and Brain Sciences 13:458–66. [PRK]CrossRefGoogle Scholar
Verville, E. & Cameron, N. (1946) Age and sex differences in the perception of incomplete pictures in adults. Pedagogical Seminary 68:149–57. [rJKT]Google Scholar