Lower bounds for the conductor of L-functions
J. Kaczorowski, A. Perelli (2012)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Circuit lower bounds and linear codes.”
Lower bounds for the conductor of L-functions
Approximate formulae for L(1,χ)
Olivier Ramaré (2001)
Acta Arithmetica
Similarity:
An improper Cramer-Rao lower bound
L. Gajek (1987)
Applicationes Mathematicae
Similarity:
Automated proofs of upper bounds on the running time of splitting algorithms.
Kulikov, A.S., Fedin, S.S. (2004)
Zapiski Nauchnykh Seminarov POMI
Similarity:
Lower Bounds on the Directed Sweepwidth of Planar Shapes
Markov, Minko, Haralampiev, Vladislav, Georgiev, Georgi (2015)
Serdica Journal of Computing
Similarity:
We investigate a recently introduced width measure of planar shapes called sweepwidth and prove a lower bound theorem on the sweepwidth.
Lower order terms of the second moment of S(t)
Tsz Ho Chan (2006)
Acta Arithmetica
Similarity:
Sharp bounds for the number of solutions to simultaneous Pellian equations
P. G. Walsh (2007)
Acta Arithmetica
Similarity:
On integrable bounds for differential equations
A. Adamus (1970)
Annales Polonici Mathematici
Similarity:
Bounds for DNA codes with constant GC-content.
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
B. Chazelle, M. Sharir, J. Matousek (1995)
Discrete & computational geometry
Similarity:
New Bounds for the Maximum Size of Ternary Constant Weight Codes
Bogdanova, Galina (2000)
Serdica Mathematical Journal
Similarity:
This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96. Optimal ternary constant-weight lexicogarphic codes have been constructed. New bounds for the maximum size of ternary constant-weight codes are obtained. Tables of bounds on A3 (n, d, w) are given for d = 3, 4, 6.
Upper and lower bounds for a reactive-diffuse system with Arrhenius kinetics.
Al-Refai, Mohammed, Katatbeh, Qutaibeh (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bounds for aggregated solid transportation problem and an improved disaggregation method
C. Das, G. Patel (1988)
Matematički Vesnik
Similarity:
On the method of upper and lower solutions in abstract cones
V. Lakshmikantham, S. Leela (1983)
Annales Polonici Mathematici
Similarity:
Lower bounds for sparse matrix vector multiplication on hypercubic networks.
Manzini, Giovanni (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: