Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Minimum Circuit Size, Graph Isomorphism, and Related Problems
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power from Random Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero Knowledge and Circuit Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism in quasipolynomial time [extended abstract] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning algorithms from natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reviewing bounds on the circuit size of the hardest functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computational Problems Regarding Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4650358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is code equivalence easy to decide? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithm and minimum circuit size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8345/pdf/LIPIcs-ITCS-2018-20.pdf/ / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963858417 / rank
 
Normal rank
Property / title
 
Minimum Circuit Size, Graph Isomorphism, and Related Problems (English)
Property / title: Minimum Circuit Size, Graph Isomorphism, and Related Problems (English) / rank
 
Normal rank

Latest revision as of 11:25, 30 July 2024

scientific article; zbMATH DE number 7359357
Language Label Description Also known as
English
Minimum Circuit Size, Graph Isomorphism, and Related Problems
scientific article; zbMATH DE number 7359357

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    15 June 2021
    0 references
    reductions between NP-intermediate problems
    0 references
    graph isomorphism
    0 references
    minimum circuit size problem
    0 references
    time-bounded Kolmogorov complexity
    0 references
    Minimum Circuit Size, Graph Isomorphism, and Related Problems (English)
    0 references

    Identifiers

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