Q5092454 (Q5092454): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.CCC.2020.7 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1904.08914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bound for the collision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of Quantum Advice and One-Way Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum computing, postselection, and probabilistic polynomial-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic quantum state generation and statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-letter Reversible and Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-bounded probabilistic computations between MA and AM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptanalysis of hash and claw-free functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial method strikes back: tight quantum query bounds via dual polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual lower bounds for approximate degree and Markov-Bernstein inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Amplification and the Approximate Degree of Constant-Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Growth of Polynomials Bounded at Equally Spaced Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of nonapproximability of lattice problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangles Are Nonnegative Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of approximating the median and related statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational approximation to \(|x|\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Intersection of Two Halfspaces Has High Threshold Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximation Algorithms for # P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lightning never strikes the same state twice / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.CCC.2020.7 / rank
 
Normal rank

Latest revision as of 15:54, 30 December 2024

scientific article; zbMATH DE number 7561735
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561735

    Statements

    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    approximate counting
    0 references
    Laurent polynomials
    0 references
    QSampling
    0 references
    query complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers