Graph Isomorphism is in SPP (Q2495656): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/iandc/ArvindK06, #quickstatements; #temporary_batch_1731547958265
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Solvable black-box group problems are low for PP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Round Interactive Proofs in Finite Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Does co-NP have short interactive proofs ? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of promise problems with applications to public-key cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP-lowness and a simple definition of AWPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An oracle builder's toolkit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group-theoretic algorithms and graph isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing functions with parallel queries to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines with few accepting computations and low sets for PP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism is low for PP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A low and a high hierarchy within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of complexity classes of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Complexity of Solvable Black-Box Group Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/iandc/ArvindK06 / rank
 
Normal rank

Latest revision as of 03:00, 14 November 2024

scientific article
Language Label Description Also known as
English
Graph Isomorphism is in SPP
scientific article

    Statements

    Graph Isomorphism is in SPP (English)
    0 references
    0 references
    0 references
    30 June 2006
    0 references
    graph isomorphism
    0 references
    counting classes
    0 references
    SPP
    0 references
    lowness
    0 references

    Identifiers