Остановите войну!
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 49 matches
- 2006
- George Barmpalias:
Random non-cupping revisited. J. Complex. 22(6): 850-857 (2006) - Daniel J. Bates, Chris Peterson, Andrew J. Sommese:
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set. J. Complex. 22(4): 475-489 (2006) - Arvid J. Bessen:
A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer. J. Complex. 22(5): 660-675 (2006) - Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki:
Computability and complexity in analysis. J. Complex. 22(6): 728 (2006) - Vasco Brattka, Atsushi Yoshikawa:
Towards computability of elliptic boundary value problems in variational formulation. J. Complex. 22(6): 858-880 (2006) - Douglas S. Bridges, Robin Havea, Peter Schuster:
Ideals in constructive Banach algebra theory. J. Complex. 22(6): 729-737 (2006) - Douglas S. Bridges, Luminita Simona Vîta:
Pre-apartness structures on spaces of functions. J. Complex. 22(6): 881-893 (2006) - Thomas Brihaye, Christian Michaux:
Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. J. Complex. 22(3): 431-434 (2006) - Peter Bürgisser, Felipe Cucker:
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. J. Complex. 22(2): 147-191 (2006) - Dennis Cheung, Felipe Cucker:
Solving linear programs with finite precision: II. Algorithms. J. Complex. 22(3): 305-335 (2006) - Ligia L. Cristea, Josef Dick, Friedrich Pillichshammer:
On the mean square weighted L2 discrepancy of randomized digital nets in prime base. J. Complex. 22(5): 605-629 (2006) - Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solernó:
On the complexity of the resolvent representation of some prime differential ideals. J. Complex. 22(3): 396-430 (2006) - Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings I. J. Complex. 22(1): 29-49 (2006) - Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings II. J. Complex. 22(4): 549-603 (2006) - Santiago Figueira, Frank Stephan, Guohua Wu:
Randomness and universal machines. J. Complex. 22(6): 738-751 (2006) - Vassil Grozdanov:
The weighted b-adic diaphony. J. Complex. 22(4): 490-513 (2006) - Stefan Heinrich:
Monte Carlo approximation of weakly singular integral operators. J. Complex. 22(2): 192-219 (2006) - Stefan Heinrich:
The randomized information complexity of elliptic PDE. J. Complex. 22(2): 220-249 (2006) - Stefan Heinrich:
The quantum query complexity of elliptic PDE. J. Complex. 22(5): 691-725 (2006) - Peter Hertling:
A sequentially computable function that is not effectively continuous at any point. J. Complex. 22(6): 752-767 (2006) - Matthias U. Horn:
Optimal algorithms for global optimization in case of unknown Lipschitz constant. J. Complex. 22(1): 50-70 (2006) - Shinji Iizuka:
Effective continuities on effective topological spaces. J. Complex. 22(6): 894-908 (2006) - Boleslaw Z. Kacewicz:
Almost optimal solution of initial-value problems by randomized and quantum algorithms. J. Complex. 22(5): 676-690 (2006) - Peter Kritzer:
Improved upper bounds on the star discrepancy of (t, m, s)-nets and (t, s)-sequences. J. Complex. 22(3): 336-347 (2006) - Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin J. Waterhouse:
Randomly shifted lattice rules for unbounded integrands. J. Complex. 22(5): 630-651 (2006) - Branimir Lambov:
The basic feasible functionals in computable analysis. J. Complex. 22(6): 909-917 (2006) - Vitaly Maiorov:
Approximation by neural networks and learning theory. J. Complex. 22(1): 102-117 (2006) - Peter Mathé, Sergei V. Pereverzev:
The discretized discrepancy principle under general source conditions. J. Complex. 22(3): 371-381 (2006) - Wilfried Meidl:
Enumeration results on linear complexity profiles and lattice profiles. J. Complex. 22(2): 275-286 (2006) - Hrushikesh Narhar Mhaskar:
Weighted quadrature formulas and approximation by zonal function networks on the sphere. J. Complex. 22(3): 348-370 (2006)
skipping 19 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-05-06 08:44 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