Local restrictions from the Furst-Saxe-Sipser paper (Q519884): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W01 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6699111 / rank
 
Normal rank
Property / zbMATH Keywords
 
local restriction
Property / zbMATH Keywords: local restriction / rank
 
Normal rank
Property / zbMATH Keywords
 
random restriction
Property / zbMATH Keywords: random restriction / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity theory
Property / zbMATH Keywords: computational complexity theory / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm design
Property / zbMATH Keywords: algorithm design / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2557257622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2906562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isomorphism conjecture for constant depth reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3288996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions in circuit complexity: An isomorphism theorem and a gap theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the complexity of reductions / 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: On Isomorphisms and Density of $NP$ and Other Complete Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On one-one polynomial time equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A satisfiability algorithm and average-case hardness for formulas over the full binary basis / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:19, 13 July 2024

scientific article
Language Label Description Also known as
English
Local restrictions from the Furst-Saxe-Sipser paper
scientific article

    Statements

    Identifiers

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