default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Service temporarily not available.
Please try again later.
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2023
- Apollo Albright, Boris Gelfand, Michael Dixon:
Polynomial Bounds for Learning Noisy Optical Physical Unclonable Functions and Connections to Learning With Errors. CoRR abs/2308.09199 (2023) - 2022
- Waleed Mohamed Abd-Elhameed, Amr Kamel Amin:
New Formulas and Connections Involving Euler Polynomials. Axioms 11(12): 743 (2022) - 2021
- Antonia W. Bluher:
Permutation properties of Dickson and Chebyshev polynomials with connections to number theory. Finite Fields Their Appl. 76: 101899 (2021) - Gholamreza Karimi, Mehdi Heidarian:
Facial expression recognition with polynomial Legendre and partial connection MLP. Neurocomputing 434: 33-44 (2021) - María José Cantero, Francisco Marcellán, Leandro Moral, Luis Velázquez:
A CMV connection between orthogonal polynomials on the unit circle and the real line. J. Approx. Theory 266: 105579 (2021) - 2020
- Mourad E. H. Ismail, Plamen Simeonov:
Connection relations for q-Taylor polynomial bases. Adv. Appl. Math. 117: 102015 (2020) - Asoke K. Nandi:
Data Modeling With Polynomial Representations and Autoregressive Time-Series Representations, and Their Connections. IEEE Access 8: 110412-110424 (2020) - Gary McGuire, John Sheekey:
Linearized Polynomials and Their Adjoints, and Some Connections to Linear Sets and Semifields. WAIFI 2020: 37-41 - 2019
- Beatriz Carely Luna-Olivera, Criel Merino, Marcelino Ramírez-Ibáñez:
More connections between the matching polynomial and the chromatic polynomial. AKCE Int. J. Graphs Comb. 16(3): 319-323 (2019) - Taekyun Kim, Kyung-Won Hwang, Dae San Kim, Dmitry V. Dolgy:
Connection Problem for Sums of Finite Products of Legendre and Laguerre Polynomials. Symmetry 11(3): 317 (2019) - Logan A. Smith, David T. Mildebrath, Illya V. Hicks:
A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti. CoRR abs/1912.11906 (2019) - 2018
- Pingge Chen, Yuejian Peng:
Connection Between Polynomial Optimization and Maximum Cliques of Non-Uniform Hypergraphs. Order 35(2): 301-319 (2018) - Dmitry V. Dolgy, Dae San Kim, Taekyun Kim, Jongkyum Kwon:
Connection Problem for Sums of Finite Products of Chebyshev Polynomials of the Third and Fourth Kinds. Symmetry 10(11): 617 (2018) - 2017
- Stefan Schneider:
Fine-Grained Connections Between Exponential and Polynomial Time. University of California, San Diego, USA, 2017 - Biao Wu, Yuejian Peng:
The connection between polynomial optimization, maximum cliques and Turán densities. Discret. Appl. Math. 225: 114-121 (2017) - 2016
- Yanming Chang, Yuejian Peng, Yuping Yao:
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs. J. Comb. Optim. 31(2): 881-892 (2016) - Alex A. Gorodetsky, Youssef M. Marzouk:
Mercer Kernels and Integrated Variance Experimental Design: Connections Between Gaussian Process Regression and Polynomial Approximation. SIAM/ASA J. Uncertain. Quantification 4(1): 796-828 (2016) - Mircea Merca:
Connections between central factorial numbers and Bernoulli polynomials. Period. Math. Hung. 73(2): 259-264 (2016) - 2015
- Ana Peña, M. Luisa Rezola:
Connection formulas for general discrete Sobolev polynomials: Mehler-Heine asymptotics. Appl. Math. Comput. 261: 216-230 (2015) - Iván Area, Eduardo Godoy, Jaime Rodal, André Ronveaux, Alejandro Zarzo:
Bivariate Krawtchouk polynomials: Inversion and connection problems with the NAVIMA algorithm. J. Comput. Appl. Math. 284: 50-57 (2015) - Alex A. Gorodetsky, Youssef M. Marzouk:
Mercer kernels and integrated variance experimental design: connections between Gaussian process regression and polynomial approximation. CoRR abs/1503.00021 (2015) - 2014
- Philippe Chrétienne:
A polynomial algorithm for the two-connections variant of the tree p-median problem. Discret. Optim. 14: 1-16 (2014) - E. Dubon, Juan Matías Sepulcre:
On the Complex Dimensions of Nonlattice Fractal Strings in Connection with Dirichlet Polynomials. Exp. Math. 23(1): 13-24 (2014) - 2013
- Pawel J. Szablowski:
On affinity relating two positive measures and the connection coefficients between polynomials orthogonalized by these measures. Appl. Math. Comput. 219(12): 6768-6776 (2013) - Mama Foupouagnigni, Wolfram Koepf, D. D. Tcheutia:
Connection and linearization coefficients of the Askey-Wilson polynomials. J. Symb. Comput. 53: 96-118 (2013) - Pascal Maroni, Zélia da Rocha:
Connection coefficients for orthogonal polynomials: symbolic computations, verifications and demonstrations in the Mathematica language. Numer. Algorithms 63(3): 507-520 (2013) - Sabato Marco Siniscalchi, Jinyu Li, Chin-Hui Lee:
Hermitian Polynomial for Speaker Adaptation of Connectionist Speech Recognition Systems. IEEE Trans. Speech Audio Process. 21(10): 2152-2161 (2013) - 2012
- Mourad E. H. Ismail, Plamen Simeonov:
Connection relations and characterizations of orthogonal polynomials. Adv. Appl. Math. 49(2): 134-164 (2012) - Xingchao Deng, Kai-Nan Xiang, Baoyindureng Wu:
Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs. Appl. Math. Lett. 25(3): 237-244 (2012) - 2011
- Hamza Chaggara, Wolfram Koepf:
On linearization and connection coefficients for generalized Hermite polynomials. J. Comput. Appl. Math. 236(1): 65-73 (2011)
skipping 22 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-19 01:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint