Остановите войну!
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 18 matches
- 1999
- Eric Allender, Robert Beals, Mitsunori Ogihara:
The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Comput. Complex. 8(2): 99-126 (1999) - David A. Mix Barrington, Howard Straubing:
Lower bounds for modular counting by circuits with modular gates. Comput. Complex. 8(3): 258-272 (1999) - Walter Baur, Karin Halupczok:
On lower bounds for the complexity of polynomials and their multiples. Comput. Complex. 8(4): 309-315 (1999) - Christer Berg, Staffan Ulfberg:
Symmetric Approximation Arguments for Monotone Lower Bounds Without Sunflowers. Comput. Complex. 8(1): 1-20 (1999) - Markus Bläser:
Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complex. 8(3): 203-226 (1999) - Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro:
Randomness Complexity of Private Computation. Comput. Complex. 8(2): 145-168 (1999) - Martin Dietzfelbinger, Martin Hühne:
Matching upper and lower bounds for simulations of several linear tapes on one multidimensional tape. Comput. Complex. 8(4): 371-392 (1999) - Oded Goldreich, Erez Petrank:
Quantifying Knowledge Complexity. Comput. Complex. 8(1): 50-98 (1999) - Dima Grigoriev:
Complexity lower bounds for randomized computation trees over zero characteristic fields. Comput. Complex. 8(4): 316-329 (1999) - Ming-Deh A. Huang, Yiu-Chung Wong:
Solvability of systems of polynomial congruences modulo a large prime. Comput. Complex. 8(3): 227-257 (1999) - Russell Impagliazzo, Pavel Pudlák, Jirí Sgall:
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. Comput. Complex. 8(2): 127-144 (1999) - Hajime Ishihara:
Function algebraic characterizations of the polytime functions. Comput. Complex. 8(4): 346-356 (1999) - Sergei Ivanov, Michel de Rougemont:
Interactive protocols over the reals. Comput. Complex. 8(4): 330-345 (1999) - Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. 8(4): 357-370 (1999) - Bruce M. Kapron:
Feasibly Continuous Type-Two Functionals. Comput. Complex. 8(2): 188-201 (1999) - Ilan Kremer, Noam Nisan, Dana Ron:
On Randomized One-Round Communication Complexity. Comput. Complex. 8(1): 21-49 (1999) - Maciej Liskiewicz, Rüdiger Reischuk:
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. 8(3): 273-307 (1999) - Ashish V. Naik, Alan L. Selman:
Adaptive Versus Nonadaptive Queries to NP and p-Selective Sets. Comput. Complex. 8(2): 169-187 (1999)
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-24 06:30 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