Quantum weakly nondeterministic communication complexity (Q387026): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1531104768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum certificate complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of several inequalities on codes and sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Separation of Quantum and Classical One-Way Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Property Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055513 / 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: Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quantum and probabilistic communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential separation of quantum and classical communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\) / rank
 
Normal rank

Latest revision as of 04:23, 7 July 2024

scientific article
Language Label Description Also known as
English
Quantum weakly nondeterministic communication complexity
scientific article

    Statements

    Quantum weakly nondeterministic communication complexity (English)
    0 references
    0 references
    11 December 2013
    0 references
    nondeterministic communication complexity
    0 references
    quantum computing
    0 references

    Identifiers