GlobalView
lower bounds

Showing items 1 - 5 of 5.

Add to Quick Collection   All 5 Results

  • First
  • Previous
  • 1
  • Next
  • Last
Sort:
 Add All Items to Quick Collection
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1320273
Description: Let n ≥ 3 be a natural number. We study the problem of finding the smallest r such that there is a family Α of 2-subsets and 3-subsets of [n] = {1, 2,...,n} with the following properties: (1) Α is an ... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1331882
Description: Let D(n) be the maximal determinant for n × n {±1}-matrices, and R(n) = D(n)/nn/2 be the ratio of D(n) to the Hadamard upper bound. Using the probabilistic method, we prove new lower bounds... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1307020
Description: In 1975, Erdos proposed the problem of determining the maximal number of edges in a graph on n vertices that contains no triangles or squares. In this paper we consider a generalized version of the pr... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/1341399
Description: We give general lower bounds on the maximal determinant of n×n {+1,−1}-matrices, both with and without the assumption of the Hadamard conjecture. Our bounds improve on earlier results of de Launey and... More
Full Text: Full Text
Reviewed: Reviewed
Image Thumbnail
Date: 2009
Resource Type: journal article
Identifier: uon:7412
Description: Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel, is a polynomial-time transformation that transforms any given paramet... More
Reviewed: Reviewed
  • First
  • Previous
  • 1
  • Next
  • Last