scholarly journals Angle Covers: Algorithms and Complexity

2020 ◽  
pp. 94-106
Author(s):  
William Evans ◽  
Ellen Gethner ◽  
Jack Spalding-Jamieson ◽  
Alexander Wolff
Keyword(s):  
Algorithms And Complexity

scholarly journals Pareto optimal allocation under uncertain preferences: uncertainty models, algorithms, and complexity

2019 ◽  
Vol 276 ◽  
pp. 57-78 ◽  
Author(s):  
Haris Aziz ◽  
Péter Biró ◽  
Ronald de Haan ◽  
Baharak Rastegari
Keyword(s):  
Optimal Allocation ◽  
Pareto Optimal ◽  
Algorithms And Complexity ◽  
Uncertain Preferences ◽  
Uncertainty Models

Binary decompositions of probability densities and random-bit simulation

2020 ◽  
Vol 26 (2) ◽  
pp. 163-169
Author(s):  
Vladimir Nekrutkin
Keyword(s):  
New York ◽  
Distribution Function ◽  
Random Number ◽  
Discrete Distribution ◽  
Random Number Generation ◽  
Academic Press ◽  
Bernoulli Trials ◽  
Algorithms And Complexity ◽  
Binary Decomposition ◽  
Probability Densities

AbstractThis paper is devoted to random-bit simulation of probability densities, supported on {[0,1]}. The term “random-bit” means that the source of randomness for simulation is a sequence of symmetrical Bernoulli trials. In contrast to the pioneer paper [D. E. Knuth and A. C. Yao, The complexity of nonuniform random number generation, Algorithms and Complexity, Academic Press, New York 1976, 357–428], the proposed method demands the knowledge of the probability density under simulation, and not the values of the corresponding distribution function. The method is based on the so-called binary decomposition of the density and comes down to simulation of a special discrete distribution to get several principal bits of output, while further bits of output are produced by “flipping a coin”. The complexity of the method is studied and several examples are presented.

scholarly journals Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity

Algorithmica ◽  
2016 ◽  
Vol 78 (3) ◽  
pp. 914-944 ◽  
Author(s):  
Florent Foucaud ◽  
George B. Mertzios ◽  
Reza Naserasr ◽  
Aline Parreau ◽  
Petru Valicov
Keyword(s):  
Metric Dimension ◽  
Permutation Graphs ◽  
Algorithms And Complexity

scholarly journals Dominance Constraints: Algorithms and Complexity

2001 ◽  
pp. 106-125 ◽  
Author(s):  
Alexander Koller ◽  
Joachim Niehren ◽  
Ralf Treinen
Keyword(s):  
Algorithms And Complexity

Cumulative default logic: Finite characterization, algorithms, and complexity

1994 ◽  
Vol 69 (1-2) ◽  
pp. 329-345 ◽  
Author(s):  
Georg Gottlob ◽  
Mingyi Zhang
Keyword(s):  
Default Logic ◽  
Algorithms And Complexity
Sign in / Sign up

Export Citation Format

Share Document