Home
|
About
|
Membership
|
Register
|
Contact Us
|
Site Links
|
Site Map
|
Login
Record Details
«
New Search
Brief Record
Full Record
MARC Record
Bibliographic Data
Control Number
UPD-00107898129
Date and Time of Latest Transaction
20090807124412.0
Cataloging Source
DENGII
Language Code
eng
Local Call Number
LG 993.5 2009 C65 B86
Main Entry - Personal Name
Buño, Kelvin C.
Title Statement
Communication complexity of turnpike problem / by Kelvin Buño
Physical Description
vi, 20 leaves : ill
Summary, Etc.
The aim of this research is to acquire a communication complexity for the Turnpike Reconstruction Problem. The Turnpike Reconstruction Problem is a set reconstruction problem of one dimension. We create a communication protocol to solve the problem and we show that the communication complexity of a one-way two-party communication model is n - 1 and 2n - 3, where n is the number of points that define the input multiset. This is in contrast to a protocol that has a communication complexity in terms of [( n/2)]. We also show that the Turnpike problem can also be extended to a three-party communication model and its communication complexity is 2n - 2. The research also concludes that it can still be extended to k-party communication, where k can be a multiple of the [( n/2)] elements of the input multiset
Subject Added Entry - Topical Term
Computational complexity
Index Term - Uncontrolled
Turnpike Problem
Textual Physical Form Designator
Thesis
Collection Category
FI
Location
UP DENG-II LG 993.5 2009 C65 B86 E200000623G Room-Use Only 2009 E2-498TG
Collection Category
UP
Physical Location
University of the Philippines
Diliman: College of Engineering Library II
LG 993.5 2009 C65 / B86
Digital Copy
Not Available
Add to Book Cart
|
Download MARC
Online Catalog
Basic Search
Advanced Search
Browse Subjects
Book Cart
Text Size:
S
-
M
-
L
Home
|
About
|
Membership
|
Register
|
Contact Us
|
Site Links
|
Site Map
|
Login
Copyright © 2004-2024. Philippine eLib Project
Host: U.P. Diliman University Library