Results 231 to 240 of about 96,047 (264)
Some of the next articles are maybe not open access.
A Lower Bound for Interpolation
Logic Journal of IGPL, 1997A formula \(J\) is called an interpolant of a valid implication \(A\supset B\) if \(J\) contains only the common variables of \(A\) and \(B\) and both \(A\supset J\) and \(J\supset B\) hold; \(\xi (A\supset B)\) denotes the size of the shortest interpolant of the implication \(A\supset B\).
openaire +2 more sources
Proceedings of the thirteenth annual ACM symposium on Theory of computing - STOC '81, 1981
Increased use of Very Large Scale Integration (VLSI) for the fabrication of digital circuits has led to increased interest in complexity results on the inherent VLSI difficulty of various problems. Lower bounds have been obtained for problems such as integer multiplication [1,2], matrix multiplication [7], sorting [8], and discrete Fourier transform [9]
Richard J. Lipton, Robert Sedgewick
openaire +1 more source
Increased use of Very Large Scale Integration (VLSI) for the fabrication of digital circuits has led to increased interest in complexity results on the inherent VLSI difficulty of various problems. Lower bounds have been obtained for problems such as integer multiplication [1,2], matrix multiplication [7], sorting [8], and discrete Fourier transform [9]
Richard J. Lipton, Robert Sedgewick
openaire +1 more source
Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Applied Mathematics and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Lower Bounds for Kernelization
2014Kernelization is the process of transforming the input of a combinatorial decision problem to an equivalent instance, with a guarantee on the size of the resulting instances as a function of a parameter. Recent techniques from the field of fixed parameter complexity and tractability allow to give lower bounds for such kernels.
openaire +1 more source
Lower bounds for lower Ramsey numbers
Journal of Graph Theory, 1990AbstractFor any graph G, let i(G) and μ;(G) denote the smallest number of vertices in a maximal independent set and maximal clique, respectively. For positive integers m and n, the lower Ramsey number s(m, n) is the largest integer p so that every graph of order p has i(G) ≤ m or μ;(G) ≤ n. In this paper we give several new lower bounds for s (m, n) as
Ralph J. Faudree +3 more
openaire +1 more source
Lower bounds for asynchronous consensus
Distributed Computing, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Lower Bounds on Crosspoints in Concentrators
IEEE Transactions on Computers, 1982Lower bounds on the required number of crosspoints in concentrators, a class of interconnection networks, are given. The lower bounds are obtained from a straightforward necessary condition on the number of crosspoints in sparse crossbar full capacity concentrators. Because this condition must be satisfied by all full capacity concentrators embedded in
Shinji Nakamura, Gerald M. Masson
openaire +2 more sources
On Lower Bounds For Covering Codes
Designs, Codes and Cryptography, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mahesh C. Bhandari +2 more
openaire +2 more sources
Lower‐bounds on the connectivities of a graph
Journal of Graph Theory, 1985AbstractThis article presents a study of the connectivities of a graph as a function of other graph parameters such as the number of vertices, the maximum degree, and the diameter. As a result, lower‐bounds on the connectivities of a graph as a function of these parameters are computed.
openaire +1 more source