Остановите войну!
for scientists:
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 11 matches
- 2022
- Jiang Ma, Jun Zhang, Yanguo Jia, Xiumin Shen:
Linear Complexity of New Binary Sequence Derived From Polynomial Quotients Modulo p in General Case and Their Generalizations. IEEE Access 10: 98855-98859 (2022) - 2017
- Moises Delgado, Heeralal Janwa:
Some new results on the conjecture on exceptional APN functions and absolutely irreducible polynomials: The gold case. Adv. Math. Commun. 11(2): 389-396 (2017) - 2015
- T. Karthick:
New Polynomial Case for Efficient Domination in P 6-free Graphs. CALDAM 2015: 81-88 - Vinaya R. Gad, Rajendra S. Gad, Gourish M. Naik:
Configurable CRC Error Detection Model for Performance Analysis of Polynomial: Case Study for the 32-Bits Ethernet Protocol. NEW2AN 2015: 529-542 - 2014
- T. Karthick:
New polynomial case for efficient domination in $P_6$-free graphs. CoRR abs/1409.1676 (2014) - 2013
- Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. MFCS 2013: 195-206 - Andreas Brandstädt, Martin Milanic, Ragnar Nevries:
New Polynomial Cases of the Weighted Efficient Domination Problem. CoRR abs/1304.6255 (2013) - 2011
- Amirhossein Amiraslani:
The equivalence of the constrained Rayleigh quotient and Newton methods for matrix polynomials expressed in different polynomial bases along with the confluent case. Int. J. Comput. Math. 88(6): 1158-1180 (2011) - 2008
- Nguyen Huynh Tuong, Ameur Soukhal:
Some new polynomial cases in just-in-time scheduling problems with multiple due dates. RIVF 2008: 36-41 - 2004
- J. Maurice Rojas, Casey E. Stella:
New Complexity Thresholds for Sparse Real Polynomials and A-discriminants. CoRR math.AG/0411107 (2004) - 1995
- Rainer E. Burkard, Vladimir G. Deineko:
Polynomially Solvable Cases of the Traveling Salesman Problem and a New Exponential Neighborhood. Computing 54(3): 191-212 (1995)
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-04-24 02:42 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