• Cite/Export
  Cite/Export

  Copy a citation

  APA (6th ed.)

  

  Chicago (Author-Date, 15th ed.)

  

  Harvard (18th ed.)

  

  MLA (7th ed.)

  

  Turabian (6th ed.)

  

  Export a citation

  Export to RefWorks   Export to EndNote / Reference Manager   Export to EasyBib   Cancel

  Note: Citations are based on reference standards. However, formatting rules can vary widely between applications and fields of interest or study. The specific requirements or preferences of your reviewing publisher, classroom teacher, institution or organization should be applied.
• Print
• E-mail
  E-mail

  All fields are required.

  The E-mail Address(es) field is required. Please enter recipient e-mail address(es).

  The E-mail Address(es) you entered is(are) not in a valid format. Please re-enter recipient e-mail address(es).

  You may send this item to up to five recipients.

  Enter recipient e-mail address(es): Separate up to five addresses with commas (,)

  The name field is required. Please enter your name.

  Enter your name: The subject field is required. Please enter the subject. Subject:

  The E-mail message field is required. Please enter the message.

  E-mail Message: I thought you might be interested in this item at http://www.worldcat.org/oclc/227455450 Title: The Complexity of Searching Lines in the Plane: Preliminary Version. Author: Richard J Lipton; David Dobkin; YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE Publisher: Ft. Belvoir Defense Technical Information Center JAN 1975. OCLC:227455450

  
  

  The ReCaptcha terms you entered were incorrect. Please try to match the 2 words shown in the window, or try the audio version.

  Cancel
• Share
• Permalink
  Permalink

  Copy this URL to link to this page:

• Write a review
• Rate this item:
• • 1
  • 2
  • 3
  • 4
  • 5

More like this

Subjects

• Computer Programming and Software.
• Computer programming.
• Searching.
• View all subjects

Similar Items

The Complexity of Searching Lines in the Plane: Preliminary Version.

Author:	Richard J Lipton; David Dobkin; YALE UNIV NEW HAVEN CONN DEPT OF COMPUTER SCIENCE.
Publisher:	Ft. Belvoir Defense Technical Information Center JAN 1975.
Edition/Format:	Book : English
Summary:	Searching is a fundamental operation of computer science. Yet a number of key mathematical questions about searching in Euclidian spaces remains open. A number of such questions are formulated and answered here for searching lines in the plane. Relationships between the results here and higher dimensional analogs for other problems of interest are given. Among the new results is a mathematical framework in which questions about searching can be stated in a more uniform manner than was possible before. Specific results are also given on the searching complexity of various sets of lines in the plane. In particular, it is shown that there are easy and hard sets of lines to search and establish methods of generating upper and lower bounds on the search complexities of such sets.  Read more...
Rating:	(not yet rated) 0 with reviews - Be the first.