Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Robust polynomials and quantum algorithms
Harry Buhrman
,
Ilan Newman
, Hein Rohrig
, Ronald De Wolf
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Robust polynomials and quantum algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Boolean Functions
100%
Classical Model
50%
Fault-tolerant
50%
Noisy Input
50%
Polynomial-time Algorithm
100%
Quantum Algorithms
100%
Quantum Decision Trees
50%
Robust Polynomials
100%
Mathematics
Approximates
25%
Boolean Function
50%
Classical Model
25%
Decision Tree
25%
Input Bit
50%
Main Result
25%
Polynomial
100%
Quantum Algorithm
100%
Computer Science
Boolean Function
100%
Decision Tree
50%
Fault Tolerant
50%
Polynomial Algorithm
100%
Quantum Algorithm
100%