Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as… 
2011
2011
In this work, we present the study of the behavior of 15 tomato cultivars under different grow lights to evaluate the quality of… 
2011
2011
Environmental context The absorption of water by mixtures of organic matter in aerosols influences various atmospheric processes… 
2011
2011
  • P. Rao
  • 2011
  • Corpus ID: 168422528
introduCtion Electronic human resource management (e-HRM) is the process of using online technology for human resource management… 
2009
2009
This paper introduces the concept of collective narcissism an emotional investment in an unrealistic belief about the in-group’s… 
2008
2008
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial… 
2007
2007
Two experiments compared the social orientations of people with high and low self-esteem (HSEs vs. LSEs). In Experiment 1… 
2005
2005
Four old and endangered tomato cultivars were cultivated under greenhouse conditions with different levels of organic N… 
1998
1998
Nisan, Rudich, and Saks [25] a&cd whether one help bit can reduce the complexity of computing a boolean function on two inputs in… 
1995
1995
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…