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
no matches
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 110 matches
- 2024
- Jean-Renaud Pycke:
A Discrete Cramér-Von Mises Statistic Related to Hahn Polynomials with Application to Goodness-of-Fit Testing for Hypergeometric Distributions. Axioms 13(6): 369 (2024) - Erhard Aichinger, Simon Grünbacher, Paul Hametner:
Zero testing and equation solving for sparse polynomials on rectangular domains. Finite Fields Their Appl. 95: 102379 (2024) - Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha:
NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. ICALP 2024: 16:1-16:21 - Ido Nahshon, Amir Shpilka:
New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials. ISSAC 2024: 91-99 - Omkar Baraskar, Agrim Dewan, Chandan Saha:
Testing Equivalence to Design Polynomials. STACS 2024: 9:1-9:22 - Omkar Baraskar, Agrim Dewan, Chandan Saha:
Testing equivalence to design polynomials. Electron. Colloquium Comput. Complex. TR24 (2024) - Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha:
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Armelle Perret du Cray:
Algorithmes pour les polynômes creux: interpolation, arithmétique, test d'identité. (Algorithms for Sparse Polynomials: interpolation, arithmetic, identity testing). University of Montpellier, France, 2023 - Guanjie Lyu, Mohamed Belalia:
Testing symmetry for bivariate copulas using Bernstein polynomials. Stat. Comput. 33(6): 128 (2023) - Adrian She, Henry Yuen:
Unitary Property Testing Lower Bounds by Polynomials. ITCS 2023: 96:1-96:17 - Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. STACS 2023: 22:1-22:20 - Ido Nahshon, Amir Shpilka:
New Bounds on Quotient Polynomials with Applications to Exact Divisibility and Divisibility Testing of Sparse Polynomials. CoRR abs/2308.03885 (2023) - 2022
- Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68(4): 997-1048 (2022) - B. V. Raghavendra Rao, Jayalal Sarma:
Isomorphism testing of read-once functions and polynomials. Inf. Comput. 285(Part): 104921 (2022) - Majid Ghorbani, Hossein Rezaei, Aleksei Tepljakov, Eduard Petlenkov:
Robust stability testing function for a complex interval family of fractional-order polynomials. J. Frankl. Inst. 359(17): 10038-10057 (2022) - Nader H. Bshouty:
Almost Optimal Proper Learning and Testing Polynomials. LATIN 2022: 312-327 - Nader H. Bshouty:
Almost Optimal Proper Learning and Testing Polynomials. CoRR abs/2202.03207 (2022) - Shaoshi Chen, Lixin Du, Hanqian Fang:
Shift Equivalence Testing of Polynomials and Symbolic Summation of Multivariate Rational Functions. CoRR abs/2204.06968 (2022) - Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. CoRR abs/2207.10588 (2022) - Adrian She, Henry Yuen:
Unitary property testing lower bounds by polynomials. CoRR abs/2210.05885 (2022) - Suryajith Chillara, Coral Grichener, Amir Shpilka:
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Dmitriy Kunisky:
Hypothesis testing with low-degree polynomials in the Morris class of exponential families. COLT 2021: 2822-2848 - Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
On Exact Division and Divisibility Testing for Sparse Polynomials. ISSAC 2021: 163-170 - Joshua A. Grochow, Youming Qiao, Gang Tang:
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms. STACS 2021: 38:1-38:17 - Shir Peleg, Amir Shpilka:
Polynomial time deterministic identity testing algorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomials. STOC 2021: 259-271 - Pascal Giorgi, Bruno Grenet, Armelle Perret du Cray:
On exact division and divisibility testing for sparse polynomials. CoRR abs/2102.04826 (2021) - 2020
- Papri Dey, Daniel Plaumann:
Testing Hyperbolicity of Real Polynomials. Math. Comput. Sci. 14(1): 111-121 (2020) - Mitali Bafna, Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Random Struct. Algorithms 57(3): 658-694 (2020) - Markus Bläser, Anurag Pandey:
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. APPROX-RANDOM 2020: 8:1-8:13 - Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG 2020: 8:1-8:14
skipping 80 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-16 03:21 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