Остановите войну!
for scientists:
default search action
Dima Grigoriev
- > Home > Persons > Dima Grigoriev
Publications
- 1998
- [j20]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. 7(3): 193-203 (1998) - [j19]Dima Grigoriev, Marek Karpinski:
Computing the Additive Complexity of Algebraic Circuits with Root Extracting. SIAM J. Comput. 27(3): 694-701 (1998) - [c20]Dima Grigoriev, Marek Karpinski:
An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC 1998: 577-582 - 1997
- [j18]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Comput. Complex. 6(4): 357-375 (1997) - [j17]Dima Grigoriev, Marek Karpinski, Roman Smolensky:
Randomization and the Computational Power of Analytic and Algebraic Decision Trees. Comput. Complex. 6(4): 376-388 (1997) - [j16]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees. Discret. Comput. Geom. 17(2): 191-215 (1997) - [c18]Dima Grigoriev, Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack. STOC 1997: 76-85 - 1996
- [j12]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. Fundam. Informaticae 28(3-4): 297-301 (1996) - [j10]Dima Grigoriev, Marek Karpinski:
Computability of the Additive Complexity of Algebraic Circuits with Root Extracting. Theor. Comput. Sci. 157(1): 91-99 (1996) - [c16]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. STOC 1996: 612-619 - [i3]Dima Grigoriev, Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c15]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees. FOCS 1995: 258-265 - [i2]Dima Grigoriev, Marek Karpinski, Andrew Chi-Chih Yao:
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j7]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Computational Complexity of Sparse Rational Interpolation. SIAM J. Comput. 23(1): 1-11 (1994) - [c12]Dima Grigoriev, Marek Karpinski, Nicolai N. Vorobjov Jr.:
Lower bounds on testing membership to a polyhedron by algebraic decision trees. STOC 1994: 635-644 - 1993
- [c11]Dima Grigoriev, Marek Karpinski:
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. AAECC 1993: 162-169 - 1992
- [c10]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. ISSAC 1992: 117-122 - 1991
- [c9]Dima Grigoriev, Marek Karpinski:
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]. FOCS 1991: 662-669 - [c8]Dima Grigoriev, Marek Karpinski:
Algorithms for Sparse Rational Interpolation. ISSAC 1991: 7-13 - 1990
- [j4]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields. SIAM J. Comput. 19(6): 1059-1063 (1990) - [c7]Dima Grigoriev, Marek Karpinski, Michael F. Singer:
Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents. FOCS 1990: 840-846 - 1987
- [c4]Dima Grigoriev, Marek Karpinski:
The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract). FOCS 1987: 166-172
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.
last updated on 2024-02-15 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint