His main research concerns Discrete mathematics, Combinatorics, Upper and lower bounds, Communication complexity and Polynomial. He conducts interdisciplinary study in the fields of Discrete mathematics and Randomness through his research. The Combinatorics study combines topics in areas such as Multilinear map, PCP theorem, Constant and Exponential function.
His study focuses on the intersection of PCP theorem and fields such as Hardness of approximation with connections in the field of MAX-3SAT, Unique games conjecture, Boolean satisfiability problem and Logarithm. His Communication complexity research includes elements of Function, Quantum network, Boolean function and Complement. Ran Raz works mostly in the field of Polynomial, limiting it down to topics relating to Polynomial identity testing and, in certain cases, Arithmetic circuit complexity, as a part of the same area of interest.
Ran Raz spends much of his time researching Discrete mathematics, Combinatorics, Upper and lower bounds, Constant and Communication complexity. His studies in Discrete mathematics integrate themes in fields like Computational complexity theory, Multilinear map, Polynomial and Degree. As part of one scientific family, Ran Raz deals mainly with the area of Combinatorics, narrowing it down to issues related to the Function, and often Distribution.
Ran Raz interconnects Time complexity, Matrix, Mathematical proof and Bounded function in the investigation of issues within Upper and lower bounds. His Constant research incorporates elements of Field, Simple, MAX-3SAT and Finite field. His Communication complexity research incorporates themes from Complexity index, Exponential function, Worst-case complexity and Average-case complexity.
His primary scientific interests are in Upper and lower bounds, Combinatorics, Discrete mathematics, Communication complexity and Time complexity. His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Function, Matrix and Bounded function. His work carried out in the field of Combinatorics brings together such families of science as Logarithm and Maximization.
His work in the fields of Discrete mathematics, such as Boolean circuit, overlaps with other areas such as Repetition. His Communication complexity research includes themes of Worst-case complexity, Boolean function, Exponential function and Average-case complexity. His biological study spans a wide range of topics, including Class, Encryption, Public-key cryptography and Cryptography.
Ran Raz mainly focuses on Combinatorics, Upper and lower bounds, Discrete mathematics, Communication complexity and Time complexity. His work in the fields of Combinatorics, such as Boolean circuit, intersects with other areas such as Row. His Upper and lower bounds study combines topics in areas such as Binary logarithm, Logarithm and Maximization.
Ran Raz integrates many fields, such as Discrete mathematics and Data stream, in his works. As part of the same scientific family, he usually focuses on Communication complexity, concentrating on Average-case complexity and intersecting with Descriptive complexity theory and Complexity index. His research integrates issues of Encryption, Public-key cryptography and Cryptography in his study of Time complexity.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
Ran Raz;Shmuel Safra.
symposium on the theory of computing (1997)
A Parallel Repetition Theorem
SIAM Journal on Computing (1998)
ProMate: a structure based prediction program to identify the location of protein-protein binding sites.
Hani Neuvirth;Ran Raz;Gideon Schreiber.
Journal of Molecular Biology (2004)
Distance labeling in graphs
Cyril Gavoille;David Peleg;Stéphane Pérennes;Ran Raz.
Journal of Algorithms (2004)
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard
I. Dinur;G. Kindler;R. Raz;S. Safra.
Extracting all the randomness and reducing the error in Trevisan's extractors
Ran Raz;Omer Reingold;Salil Vadhan.
symposium on the theory of computing (1999)
Exponential separation of quantum and classical communication complexity
symposium on the theory of computing (1999)
Monotone circuits for matching require linear depth
Ran Raz;Avi Wigderson.
Journal of the ACM (1992)
Exponential separations for one-way quantum communication complexity, with applications to cryptography
Dmitry Gavinsky;Julia Kempe;Iordanis Kerenidis;Ran Raz.
symposium on the theory of computing (2007)
Extractors with weak random seeds
symposium on the theory of computing (2005)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: