No label defined (Q4787422)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1849180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1849180 |
Statements
7 January 2003
0 references
Symposium
0 references
Proceedings
0 references
Kyoto (Japan)
0 references
RIMS
0 references
Computation
0 references
Algorithms
0 references
0.8340465426445007
0 references
0.8217573761940002
0 references
The articles of this volume will not be indexed individually. Contents: Jun Kiniwa, An extended depth-first search. How to decrease backtracking (1-6); Liang Zhao, Hiroshi Nagamochi and Toshihide Ibaraki, A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (7-12); Takaaki Mizuki and Takao Nishizeki, Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups (13-18); Wang Yue, Katsushi Inoue, Akira Ito and Tokio Okazaki, On the power of cooperating systems of one-way hybrid finite automata (19-24); Masaki Nakanishi, Kiyoharu Hamaguchi and Toshinobu Kashiwabara, On the power of bounded width quantum branching programs (Japanese) (25-30); Kenji Fujita, Kenichi Morita, Chuzo Iwamoto and Katsunobu Imai, Self-reproduction in number conserving cellular spaces (Japanese) (31-36); Hirotoshi Honma and Shigeru Masuyama, A parallel algorithm for finding all hinge vertices of a trapezoid graph (37-42); Kiyonobu Tomiyama, Tomokazu Arita, Kensei Tsuchida and Takeo Yaku, Application of attribute edNCE graph grammars to syntactic editing of tabular forms (43-46); Akira Ito, Katsushi Inoue, Yue Wang and Tokio Okazaki, Complexity of computation of the rock, scissors, paper game (Japanese) (47-52); Keisuke Tanaka and Tatsuaki Okamoto, Quantum public-key cryptosystems and their improvement (53-58); Michiko Omori, Kumiko Obokata and Yoshihide Igarashi, Lockout avoidance algorithms without using time-stamps for the \(k\)-exclusion problem (59-64); Kengo Kubo, Keizo Yamada, Kouichi Hirata and Masateru Harao, Efficient \(2\)-level predicate matching algorithms that use pre-checking (Japanese) (65-70). Tetsuhiro Miyahara, Takayoshi Shoudai and Tomoyuki Uchida, Discovery of maximally frequent tag tree patterns in semistructured data (71-76); Jia Lee, Katsunobu Imai and Kenichi Morita, Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars (77-82); Shinji Kadono and Yasuhiko Takenaga, Complexity of decisions for tree-shellable theoretical functions (Japanese) (83-88); Hiroshi Nagamochi, Yukihiro Nishida and Toshihide Ibaraki, A polynomial time approximation scheme for the minimum maximal matching problem in planar graphs (89-94); Rainer Schuler, Uwe Schöning and Osamu Watanabe, An improved randomized algorithm for 3-SAT (95-100); Jin Shan Qi, Ruhizan Liza Ahmad Shauri and Kenichi Morita, Generation of simply-connected patterns and simple closed curves by uniquely parsable array grammars (Japanese) (101-106); Hirotsugu Kakugawa and Masafumi Yamashita, A universal self-stabilizing mutual exclusion algorithm (107-112); Akihiro Matsuura and Kazuo Iwama, On the complexity of subproblems of SAT (113-118); Hiroshi Imahayashi, Toshio Nakata and Masafumi Yamashita, Distribution of the length of the longest route in stochastic graphs---the importance of branches (Japanese) (119-124); Kampei Miyakawa and Hiroshi Narushima, Some properties of the distortion index on all MPRs. II (Japanese) (125-130); Shirou Matsuura and Tomomi Matsui, An approximate method for solving the MAX DICUT problem (Japanese) (131-135); Toru Araki and Yukio Shibata, Construction of optimal fault-diagonosable systems that use graph operations (Japanese) (136-141). Kouichi Hirata, Hiroshi Sakamoto and Hiroki Arimura, A catalog for prediction-preserving reducibility with membership queries on formal languages (142-147); Baoding Liu and Kakuzo Iwamura, Topological optimization models for communication network with multiple reliability goals (148-153); Hiromitsu Shiina and Shigeru Masuyama, Unrestricted \(\text{LR}(k)\) grammars and its parser, where \(k=0,1\) (154-159); Akio Nakata, Deriving parameter conditions for periodic timed automata satisfying real-time temporal logic formulas (160-165); Takenori Abe, Toshinori Takai, Yuichi Kaji and Hiroyuki Seki, Termination of finite path overlapping term rewriting system (Japanese) (166-171); Hajime Machida, Masahiro Miyakawa and Ivo G. Rosenberg, Galois connection between clones and full monoids (172-177); Akihiro Uejima, Akiko Sanada, Hiro Ito, Hideyuki Uehara and Mitsuo Yokoyama, Application and analysis of the coloring problem with restrictions of adjacent colors that has circulant restrictions (Japanese) (178-182); Satoshi Iwata and Satoshi Okawa, The competitiveness of diversified investment on portfolio selection problem (183-187); Masami Amano and Kazuo Iwama, On the difference of the computational powers that is produced through the difference in the probability computations of a quantum model and a probabilistic model (188-193); Junnosuke Moriya and Tetsuro Nishino, Construction methods for Turing machines and equivalent simple recurrent networks (Japanese) (194-199); Hiroyuki Kawai and Yukio Shibata, Isomorphic factorization of the Kronecker product of generalized de Bruijn digraphs (200-205); Jin Uemura and Masako Sato, An efficient inductive study of regular patterns that involve erasable and nonerasable variables (Japanese) (206-211).
0 references