On the black-box complexity of Sperner's Lemma (Q839637): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-008-9121-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046839291 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q125054626 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0505185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Local Search by Quantum Arguments / 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: Polynomial degree vs. quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mod 2 degree and a generalized No Retraction Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of 2D Discrete Fixed Point Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Separation of Local Search and Fixed Point Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner's lemma and robust machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial maps from an orientable n-pseudomanifold into Sm with the octahedral triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A separator theorem for graphs of bounded genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner lemma complete for PPA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dividing and conquering the square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optimization on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum and classical query complexities of local search are polynomially related / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Power of Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-008-9121-2 / rank
 
Normal rank

Latest revision as of 04:46, 10 December 2024

scientific article
Language Label Description Also known as
English
On the black-box complexity of Sperner's Lemma
scientific article

    Statements

    On the black-box complexity of Sperner's Lemma (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2009
    0 references
    query complexity
    0 references
    Sperner's Lemma
    0 references
    deterministic algorithm
    0 references
    probabilistic and quantum lower bound
    0 references
    0 references

    Identifiers