![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 27 matches
- 1992
- Peter Bürgisser, Thomas Lickteig, Michael Shub:
Test complexity of generic polynomials. J. Complex. 8(3): 203-215 (1992) - Shui-Nee Chow, Kenneth J. Palmer:
On the numerical computation of orbits of dynamical systems: The higher dimensional case. J. Complex. 8(4): 398-423 (1992) - Felipe Cucker
:
PR != NCR. J. Complex. 8(3): 230-238 (1992) - Felipe Cucker
, A. Torrecillas:
Two P-complete problems in the theory of the reals. J. Complex. 8(4): 454-466 (1992) - Ding-Zhu Du, Ker-I Ko:
A note on best fractions of a computable real number. J. Complex. 8(3): 216-229 (1992) - Gensun Fang, Yongping Liu:
On the optimal quadrature least Linfinity-norm of monosplines with free knots on the real axis. J. Complex. 8(4): 467-487 (1992) - Siegfried Graf:
Barnsley's scheme for the fractal encoding of images. J. Complex. 8(1): 72-78 (1992) - Stefan Heinrich:
Lower bounds for the complexity of Monte Carlo function approximation. J. Complex. 8(3): 277-300 (1992) - Nikolaj P. Korneichuk:
Encoding and recovery of operator values. J. Complex. 8(1): 79-91 (1992) - Lung-Tien Liu, Gen-Huey Chen, Ching-Sung Lu:
On the complexity of generating synchronizable test sequences. J. Complex. 8(4): 434-450 (1992) - Georgii G. Magaril-Il'yaev, Vladimir M. Tikhomirov:
Average dimension and ?-widths of classes of functions on the whole line. J. Complex. 8(1): 64-71 (1992) - Klaus Meer:
A note on a P NP result for a restricted class of real machines. J. Complex. 8(4): 451-453 (1992) - Arkadi S. Nemirovsky:
Information-based complexity of linear operator equations. J. Complex. 8(2): 153-175 (1992) - Erich Novak:
Optimal linear randomized methods for linear operators in Hilbert spaces. J. Complex. 8(1): 22-36 (1992) - Erich Novak, Henryk Wozniakowski:
Relaxed verification for continuous problems. J. Complex. 8(2): 124-152 (1992) - Victor Y. Pan:
Parallel solution of toeplitzlike linear systems. J. Complex. 8(1): 1-21 (1992) - Sergei V. Pereverzev
, Cosnazar C. Scharipov:
Information complexity of equations of the second kind with compact operators in Hilbert space. J. Complex. 8(2): 176-202 (1992) - Leszek Plaskota:
Function approximation and integration on the wiener space with noisy data. J. Complex. 8(3): 301-323 (1992) - Tadeusz Strzemecki:
Polynomial-time algorithms for generation of prime implicants. J. Complex. 8(1): 37-63 (1992) - Roberto Tempo, Vito Cerone:
Robust stability: The computational complexity point of view. J. Complex. 8(3): 265-276 (1992) - Prasoon Tiwari:
A problem that is easier to solve on the unit-cost algebraic RAM. J. Complex. 8(4): 393-397 (1992) - Grzegorz W. Wasilkowski:
On a posteriori upper bounds for approximating linear functionals in a probabilistic setting. J. Complex. 8(4): 424-433 (1992) - Lan Wen:
Anosov endomorphisms on branched surfaces. J. Complex. 8(3): 239-264 (1992) - Klaus Wilderotter:
n-Widths of Hp-spaces in Lq(-1, 1). J. Complex. 8(3): 324-335 (1992) - Henryk Wozniakowski:
Complexity of verification and computation for IBC problems. J. Complex. 8(2): 93-123 (1992) - Henryk Wozniakowski:
Average case complexity of linear multivariate problems I. Theory. J. Complex. 8(4): 337-372 (1992) - Henryk Wozniakowski:
Average case complexity of linear multivariate problems II. Applications. J. Complex. 8(4): 373-392 (1992)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-07-24 14:20 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