Bounded-depth succinct encodings and the structure they imply on graphs (Q722204): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-017-9787-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2624065397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs by the minimum number of equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy for nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On covering graphs by complete bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs of small dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On set intersection representations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Coverings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On completeness for NP via projection translations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages represented by Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258578 / rank
 
Normal rank

Latest revision as of 04:09, 16 July 2024

scientific article
Language Label Description Also known as
English
Bounded-depth succinct encodings and the structure they imply on graphs
scientific article

    Statements

    Bounded-depth succinct encodings and the structure they imply on graphs (English)
    0 references
    23 July 2018
    0 references
    complexity
    0 references
    succinct
    0 references
    circuits
    0 references
    biclique
    0 references
    graphs
    0 references
    NP
    0 references

    Identifiers