Record Details
 
  « New Search    
   
 
Bibliographic Data
Control NumberUPD-00107898129
Date and Time of Latest Transaction20090807124412.0
Cataloging SourceDENGII
Language Codeeng
Local Call NumberLG 993.5 2009 C65 B86
Main Entry - Personal NameBuño, Kelvin C.
Title StatementCommunication complexity of turnpike problem / by Kelvin Buño
Physical Descriptionvi, 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 TermComputational complexity
Index Term - UncontrolledTurnpike Problem
Textual Physical Form DesignatorThesis
Collection CategoryFI
LocationUP DENG-II LG 993.5 2009 C65 B86 E200000623G Room-Use Only 2009 E2-498TG
Collection CategoryUP
 
     
 
Physical Location
University of the Philippines
Diliman: College of Engineering Library IILG 993.5 2009 C65 / B86
 
     
 
Digital Copy
Not Available
 
     
 
         
         
Online Catalog
Basic Search
Advanced Search
Browse Subjects
Book Cart
 
         

Text Size:
S  -  M  -  L
Copyright © 2004-2024. Philippine eLib Project
Host: U.P. Diliman University Library