Q4972729 (Q4972729): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Hitting Set Kernels By AC^0-Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of parameterized problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: ``Advice classes of parameterized tractability'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, quantifier elimination, and quantifier rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some lower bounds in parameterized \(\mathrm{AC}^{0}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine-based methods in parameterized complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of existential positive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: One Hierarchy Spawns Another / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space and circuit complexity of parameterized problems: classes and completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Describing parameterized complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness for First-order Properties on Sparse Structures with Algorithmic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta Theorems for Sparse Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is the evaluation of conjunctive queries tractable? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient recognition of sparse self-reducible languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized random complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Monotone Switching Networks for Directed Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-size bounded alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties that characterize LOGCFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of graph connectivity / rank
 
Normal rank

Latest revision as of 02:10, 21 July 2024

scientific article; zbMATH DE number 7136657
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7136657

    Statements

    0 references
    0 references
    0 references
    26 November 2019
    0 references
    model checking
    0 references
    bounded-variable first-order logic
    0 references
    parameterized logarithmic space
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references