Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,217,328 papers from all fields of science
Search
Sign In
Create Free Account
Steven Rudich
Known as:
Rudich
Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science. In 1994, he and Alexander Razborov proved that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Computational complexity theory
DTIME
Gödel Prize
Journal of Cryptology
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The number system hidden inside the Boolean satisfiability problem
Keum-Bae Cho
arXiv.org
2014
Corpus ID: 11403501
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as…
Expand
2011
2011
Changes in Endogenous Auxin Concentration in Cultivars of Tomato Seedlings under Artificial Light
E. Almansa
,
A. Espín
,
R. M. Chica
,
M. Lao
2011
Corpus ID: 88899740
In this work, we present the study of the behavior of 15 tomato cultivars under different grow lights to evaluate the quality of…
Expand
2011
2011
Humidity driven nanoscale chemical separation in complex organic matter
V. Zelenay
,
T. Huthwelker
,
A. Křepelová
,
Y. Rudich
,
M. Ammann
2011
Corpus ID: 98350865
Environmental context The absorption of water by mixtures of organic matter in aerosols influences various atmospheric processes…
Expand
2011
2011
E-Recruitment in Emerging Economies
P. Rao
2011
Corpus ID: 168422528
introduCtion Electronic human resource management (e-HRM) is the process of using online technology for human resource management…
Expand
2009
2009
Collective Narcissism 1 Running head : COLLECTIVE NARCISSISM AND ITS SOCIAL CONSEQUENCES Collective Narcissism and its Social Consequences
Christopher M. Federico
2009
Corpus ID: 8687271
This paper introduces the concept of collective narcissism an emotional investment in an unrealistic belief about the in-group’s…
Expand
2008
2008
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Eric Allender
Computer Science Symposium in Russia
2008
Corpus ID: 13408578
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial…
Expand
2007
2007
Self-esteem moderates preferences for accepting versus rejecting interaction partners
Eric A. Rudich
,
C. Sedikides
,
A. Gregg
2007
Corpus ID: 55985194
Two experiments compared the social orientations of people with high and low self-esteem (HSEs vs. LSEs). In Experiment 1…
Expand
2005
2005
Influence of management practices on quality and biodiversity of tomatoes in Germany
D. Klein
,
Ramesh Kumar
,
U. Koepke
2005
Corpus ID: 54592976
Four old and endangered tomato cultivars were cultivated under greenhouse conditions with different levels of organic N…
Expand
1998
1998
One help-bit doesn't help
R. Beigel
,
T. Hirst
Symposium on the Theory of Computing
1998
Corpus ID: 7808136
Nisan, Rudich, and Saks [25] a&cd whether one help bit can reduce the complexity of computing a boolean function on two inputs in…
Expand
1995
1995
Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates
Frederic Green
Symposium on Theoretical Aspects of Computer…
1995
Corpus ID: 40885765
We say an integer polynomial p, on Boolean inputs, weakly m-represents a Boolean function f if p is non-constant and is zero (mod…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE