About J-GLOBAL

日本語

Font size
  • A
  • A

Articleの詳細情報

ArticleJ-GLOBAL ID:200902002092075588整理番号:81A0262581

Lower bounds on the complexity of some optimal data structures.

ある最適データ構造の複雑さに関する下界

著者:FREDMAN M L(Univ. California at San Diego)
資料名:SIAM J Comput (Soc Ind Appl Math) 巻:10 号:1 ページ:1-10
発行年:1981年02月
  • J-GLOBAL home
  • Bookmark J-GLOBAL

J-GLOBAL: Linking, Expanding and Sparking

About J-GLOBAL

Linking

J-GLOBAL links information that represents the key to research and development. For example, linking articles and patents with people (authors and inventors) enables the extraction of a sequence of information.
It’s useful for making new discoveries and uncovering new information.

Expanding

The system enables searches of similar kinds of content through linkage with external sites.
It helps you to obtain knowledge from dissimilar fields and discover concepts that cross the boundaries of specialisms.

Sparking

Through repeated linkage and expansioniteration, J-GLOBAL provides unexpected hints for problem-solving and the illumination of new ideas.