default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Smolensky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[j9]Roman Smolensky:
Representations of Sets of Boolean Functions by Commutative Rings. Comput. Complex. 6(3): 199-208 (1997)- [j8]Roman Smolensky:
Easy Lower Bound for a Strange Computational Model. Comput. Complex. 6(3): 213-216 (1997) - [j7]Roman Smolensky:
Well-Known Bound for the VC-Dimension Made Easy. Comput. Complex. 6(4): 299-300 (1997) - [j6]Victor Shoup, Roman Smolensky:
Lower Bounds for Polynomial Evaluation and Interpolation Problems. Comput. Complex. 6(4): 301-311 (1997) - [j5]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo
, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times. Comput. Complex. 6(4): 312-340 (1997) - [j4]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) - [j3]Dima Grigoriev, Marek Karpinski, Roman Smolensky:
Randomization and the Computational Power of Analytic and Algebraic Decision Trees. Comput. Complex. 6(4): 376-388 (1997) - 1996
- [c8]Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees. STOC 1996: 612-619 - 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) - 1993
- [j2]Allan Borodin, Alexander A. Razborov, Roman Smolensky:
On Lower Bounds for Read-K-Times Branching Programs. Comput. Complex. 3: 1-18 (1993) - [c7]Roman Smolensky:
On Representations by Low-Degree Polynomials. FOCS 1993: 130-138 - 1992
- [j1]Jehoshua Bruck, Roman Smolensky:
Polynomial Threshold Functions, AC^0 Functions, and Spectral Norms. SIAM J. Comput. 21(1): 33-42 (1992) - 1991
- [c6]Victor Shoup, Roman Smolensky:
Lower Bounds for Polynomial Evaluation and Interpolation Problems. FOCS 1991: 378-383 - 1990
- [c5]Roman Smolensky:
On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates. FOCS 1990: 628-631 - [c4]Jehoshua Bruck, Roman Smolensky:
Polynomial Threshold Functions, AC^0 Functions and Spectral Norms (Extended Abstract). FOCS 1990: 632-641
1980 – 1989
- 1989
- [c3]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract). STOC 1989: 574-586 - 1987
- [c2]Roman Smolensky:
Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity. STOC 1987: 77-82 - 1985
- [c1]Benny Chor, Oded Goldreich, Johan Håstad, Joel Friedman, Steven Rudich, Roman Smolensky:
The Bit Extraction Problem of t-Resilient Functions (Preliminary Version). FOCS 1985: 396-407
Coauthor Index
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-04-24 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
