Tailoring recursion for complexity (Q4858828): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The method of forced enumeration for nondeterministic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-point extensions of first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for constant-depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Space is Closed under Complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebra and a logic for \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog extensions for database queries and updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages that Capture Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relational queries computable in polynomial time / 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: Capturing complexity classes by fragments of second-order logic / rank
 
Normal rank

Latest revision as of 08:55, 24 May 2024

scientific article; zbMATH DE number 827476
Language Label Description Also known as
English
Tailoring recursion for complexity
scientific article; zbMATH DE number 827476

    Statements

    Tailoring recursion for complexity (English)
    0 references
    0 references
    0 references
    0 references
    19 December 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial time
    0 references
    descriptive complexity theory
    0 references
    finite model theory
    0 references
    complexity classes
    0 references
    0 references