Skip to search formSkip to main contentSkip to account menu

Ran Raz

Ran Raz (Hebrew: רָן רָז‎‎) is a computer scientist who works in the area of computational complexity theory. He is a professor in the faculty of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Circuit complexityCommunication complexityComputational complexity theoryComputer scientist

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Kelsen's Pure Theory of Law
2016
2016
Transformation of amorphous calcium carbonate nanoparticles into aragonite controlled by ACCBP
Polymorph selection during shell or pearl formation has been an intriguing issue, especially for those species of interest for… 
2016
2016
A note on distance labeling in planar graphs
A distance labeling scheme is an assignments of labels, that is binary strings, to all nodes of a graph, so that the distance… 
2015
2015
Anchoring games for parallel repetition
Two major open problems regarding the parallel repetition of games are whether an analogue of Raz's parallel-repetition theorem… 
2010
2010
Kin, gene, community : reproductive technologies among Jewish Israelis
List of Tables and Figures Introduction: Reproductive Technologies among Jewish Israelis: Setting the Ground Daphna Birenbaum… 
2008
2008
El incremento de la población reclusa en España entre 1996-2006: diagnóstico y remedios
In the years 2003 and 2004 a liberal Spanish association of criminal law professors and criminal judges (Grupo de Estudios de… 
Review
2005
Review
2005
Health care rights and responsibilities: a review of the European charter of patients' rights.
This review of the European Charter of Patients' Rights includes chapters on the different kinds of rights found in Irish law… 
2004
2004
Martyrdom, Suicide, and the Islamic Law of War: A Short Legal History
The Palestinian struggle against the Israeli government and the war in Iraq have shown us that a new norm of battlefield behavior… 
2002
2002
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and… 
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
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)