Approximation of the size of the union

Shuji Jinbo, Akira Maruoka

Research output: Contribution to journalArticle

Abstract

Let k and n be integers with 1 ≤ h ≤ n; F(k, n) is the worst-case relative error generated in approximating the size of a finite system of n sets when the sizes of the intersections of all subsystems of at most k subsets are given. Linial et al. proposed a strategy to estimate F(k, n) and suggested that the strategy is applicable for the problem of counting the number of truth assignments for a DNF formula and the problem of calculating the permanent of a 0/1 matrix, both of which belong to the class of #P-complete problems. Although the time complexity increases as k increases, F(k, n) decreases their strategy. This paper gives elementary formulas that describe upper and lower bounds on F(k, n) for any k and n. The upper bound is better than the previous one when 2 ≤ n - k ≤ n/(8/loge n). Furthermore, F(k, n) = 1 + Θ(√nn-k-1/2n) is defined for any k and n such that n - k is at most a constant.

Original languageEnglish
Pages (from-to)11-23
Number of pages13
JournalSystems and Computers in Japan
Volume27
Issue number6
Publication statusPublished - Jun 1996

Fingerprint

Union
Approximation
Worst Case Error
(0, 1)-matrices
Relative Error
Time Complexity
Upper and Lower Bounds
Counting
Subsystem
Assignment
Intersection
Upper bound
Decrease
Integer
Subset
Estimate
Strategy
Class
Truth

Keywords

  • #P-complete
  • Approximation algorithms
  • Binomial coefficients
  • Polynomial approximation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Information Systems
  • Theoretical Computer Science

Cite this

Approximation of the size of the union. / Jinbo, Shuji; Maruoka, Akira.

In: Systems and Computers in Japan, Vol. 27, No. 6, 06.1996, p. 11-23.

Research output: Contribution to journalArticle

Jinbo, S & Maruoka, A 1996, 'Approximation of the size of the union', Systems and Computers in Japan, vol. 27, no. 6, pp. 11-23.
Jinbo, Shuji ; Maruoka, Akira. / Approximation of the size of the union. In: Systems and Computers in Japan. 1996 ; Vol. 27, No. 6. pp. 11-23.
@article{fd3c22d6020d4fb3a3b23d4cf1972e56,
title = "Approximation of the size of the union",
abstract = "Let k and n be integers with 1 ≤ h ≤ n; F(k, n) is the worst-case relative error generated in approximating the size of a finite system of n sets when the sizes of the intersections of all subsystems of at most k subsets are given. Linial et al. proposed a strategy to estimate F(k, n) and suggested that the strategy is applicable for the problem of counting the number of truth assignments for a DNF formula and the problem of calculating the permanent of a 0/1 matrix, both of which belong to the class of #P-complete problems. Although the time complexity increases as k increases, F(k, n) decreases their strategy. This paper gives elementary formulas that describe upper and lower bounds on F(k, n) for any k and n. The upper bound is better than the previous one when 2 ≤ n - k ≤ n/(8/loge n). Furthermore, F(k, n) = 1 + Θ(√nn-k-1/2n) is defined for any k and n such that n - k is at most a constant.",
keywords = "#P-complete, Approximation algorithms, Binomial coefficients, Polynomial approximation",
author = "Shuji Jinbo and Akira Maruoka",
year = "1996",
month = "6",
language = "English",
volume = "27",
pages = "11--23",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "6",

}

TY - JOUR

T1 - Approximation of the size of the union

AU - Jinbo, Shuji

AU - Maruoka, Akira

PY - 1996/6

Y1 - 1996/6

N2 - Let k and n be integers with 1 ≤ h ≤ n; F(k, n) is the worst-case relative error generated in approximating the size of a finite system of n sets when the sizes of the intersections of all subsystems of at most k subsets are given. Linial et al. proposed a strategy to estimate F(k, n) and suggested that the strategy is applicable for the problem of counting the number of truth assignments for a DNF formula and the problem of calculating the permanent of a 0/1 matrix, both of which belong to the class of #P-complete problems. Although the time complexity increases as k increases, F(k, n) decreases their strategy. This paper gives elementary formulas that describe upper and lower bounds on F(k, n) for any k and n. The upper bound is better than the previous one when 2 ≤ n - k ≤ n/(8/loge n). Furthermore, F(k, n) = 1 + Θ(√nn-k-1/2n) is defined for any k and n such that n - k is at most a constant.

AB - Let k and n be integers with 1 ≤ h ≤ n; F(k, n) is the worst-case relative error generated in approximating the size of a finite system of n sets when the sizes of the intersections of all subsystems of at most k subsets are given. Linial et al. proposed a strategy to estimate F(k, n) and suggested that the strategy is applicable for the problem of counting the number of truth assignments for a DNF formula and the problem of calculating the permanent of a 0/1 matrix, both of which belong to the class of #P-complete problems. Although the time complexity increases as k increases, F(k, n) decreases their strategy. This paper gives elementary formulas that describe upper and lower bounds on F(k, n) for any k and n. The upper bound is better than the previous one when 2 ≤ n - k ≤ n/(8/loge n). Furthermore, F(k, n) = 1 + Θ(√nn-k-1/2n) is defined for any k and n such that n - k is at most a constant.

KW - #P-complete

KW - Approximation algorithms

KW - Binomial coefficients

KW - Polynomial approximation

UR - http://www.scopus.com/inward/record.url?scp=0030173776&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030173776&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0030173776

VL - 27

SP - 11

EP - 23

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 6

ER -