Advice Coins for Classical and Quantum Computation (Q3012792): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1494857519 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.5355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BQP and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed timelike curves make quantum and classical computing equivalent / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Size of Small Depth Circuits for Approximating Majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms in real algebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relating Time and Space to Size and Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Regular Branching Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypothesis Testing with Finite Statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with Finite Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specified precision polynomial root isolation is in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the complex roots problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation by DNF: Examples and Counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate majority and probabilistic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded quantum complexity / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Advice Coins for Classical and Quantum Computation
scientific article

    Statements

    Advice Coins for Classical and Quantum Computation (English)
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    BQP
    0 references
    finite automata
    0 references
    finite-precision arithmetic
    0 references
    PSPACE
    0 references
    quantum computation
    0 references
    root-finding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references