Please use this identifier to cite or link to this item:
Title: A close encounter with Random Numbers
Authors: Das, Subrata
Dasgupta, Partha Sarathi
Pandey Amit
Roy Pabitra
Keywords: Algorithms
Arithmetic algorithms
Pseudorandom number
Random number
Issue Date: 2015
Publisher: SCOPUS
Proceedings of the 2015 3rd International Conference on Computer, Communication, Control and Information Technology, C3IT 2015
Institute of Electrical and Electronics Engineers Inc.
Abstract: Performance profiling or empirical testing, and statistical testing of algorithms for NP-complete problems is typically based on random sample testing. Random values constitute a good source of data for testing the effectiveness of a computer algorithm. Random number generation is an absolute proposition. As such, generally the concentration is on realistic pseudorandom number generation. There are numerous pseudorandom number generation algorithms. We propose here another drop in the sea which is at least as efficient as the existing algorithms and simpler in certain respects. © 2015 IEEE.
Description: Das, Subrata, Dept. of Information Technology, Academy of Technology, Hooghly, India; Dasgupta, Partha Sarathi, MIS Group, Indian Institute of Management Calcutta, Kolkata, India; Pandey Amit, Dept. of Information Technology, Academy of Technology, Hooghly, India; Roy Pabitra, Dept. of Computer Science and Engineering, University of Calcutta, Kolkata, India
ISSN/ISBN - 978-147994446-0
DOI - 10.1109/C3IT.2015.7060206
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.