MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03157cam a2200337Ia 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250918233809.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
140403s2012 mau b 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9781601986207 (pbk.) |
| Terms of availability |
RM315.21 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
1601986203 |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201405301122 |
| Level of effort used to assign nonsubject heading access points |
zaina |
| Level of effort used to assign subject headings |
201405231052 |
| Level of effort used to assign classification |
hamudah |
| y |
04-03-2014 |
| z |
hamudah |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
ERE |
| Language of cataloging |
eng |
| Transcribing agency |
ERE |
| Modifying agency |
YDXCP |
| -- |
UKM |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA164.D845 3 |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA164 |
| Local cutter number (OCLC) ; Book number/undivided call number, CALL (RLIN) |
.D845 3 |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Dvir, Zeev. |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Incidence theorems and their applications / |
| Statement of responsibility, etc. |
Zeev Dvir. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Boston : |
| Name of publisher, distributor, etc. |
Now, |
| Date of publication, distribution, etc. |
2012. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
ix, 137 p. ; |
| Dimensions |
24 cm. |
| 490 1# - SERIES STATEMENT |
|---|
| Series statement |
Foundations and trends in theoretical computer science ; |
| Volume/sequential designation |
Vol. 6, no. 4 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes bibliographical references (p. 133-137). |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
We survey recent (and not so recent) results concerning arrangements of lines, points, and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we will discuss are : (1) Counting incidences : Given a set (or several sets) of geometric objects (lines, points, etc.), what is the maximum number of incidences (or intersections) that can exist between elements in different sets? We will see several results of this type, such as the Szemeredi-Trotter theorem, over the reals and over finite fields and discuss their applications in combinatorics (e.g., in the recent solution of Guth and Katz to Erdos' distance problem) and in computer science (in explicit constructions of multisource extractors). (2) Kakeya type problems : These problems deal with arrangements of lines that point in different directions. The goal is to try and understand to what extent these lines can overlap one another. We will discuss these questions both over the reals and over finite fields and see how they come up in the theory of randomness extractors. (3) Sylvester-Gallai type problems : In this type of problems, one is presented with a configuration of points that contain many'local' dependencies (e.g., three points on a line) and is asked to derive a bound on the dimension of the span of all points. We will discuss several recent results of this type, over various fields, and see their connection to the theory of locally correctable error-correcting codes. Throughout the different parts of the survey, two types of techniques will make frequent appearance. One is the polynomial method, which uses polynomial interpolation to impose an algebraic structure on the problem at hand. The other recurrent techniques will come from the area of additive combinatorics. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Combinatorial analysis. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Computational complexity. |
| 907 ## - LOCAL DATA ELEMENT G, LDG (RLIN) |
|---|
| a |
.b15865721 |
| b |
2019-11-12 |
| c |
2019-11-12 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Koha item type |
AM |
| Suppress in OPAC |
No |
| Call number prefix |
QA164.D845 3 |
| 914 ## - VTLS Number |
|---|
| VTLS Number |
vtls003555514 |
| 990 ## - EQUIVALENCES OR CROSS-REFERENCES [LOCAL, CANADA] |
|---|
| Link information for 9XX fields |
zsz |
| 991 ## - LOCAL NOTE (NAMA FAKULTI/INSTITUT/PUSAT) |
|---|
| a |
Fakulti Tekonologi dan Sains Maklumat |
| 998 ## - LOCAL CONTROL INFORMATION (RLIN) |
|---|
| Library |
PERPUSTAKAAN LINGKUNGAN KEDUA |
| Operator's initials, OID (RLIN) |
2014-03-04 |
| Cataloger's initials, CIN (RLIN) |
m |
| Material Type (Sierra) |
Printed Books |
| Language |
English |
| Country |
|
| -- |
0 |
| -- |
.b15865721 |
