The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Reachability is harder for directed than for undirected finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for recognizing small cliques on CRCW PRAM's / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectra of First-Order Sentences and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantifiers and time complexity of random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nontrivial Lower Bound for an NP Problem on Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines and the spectra of first-order formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 laws and decision problems for fragments of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes and theories of finite models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic probabilities of existential second-order Gödel sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order and Inductive Definability on Finite Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709896 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:08, 16 May 2024

scientific article
Language Label Description Also known as
English
The quantifier structure of sentences that characterize nondeterministic time complexity
scientific article

    Statements

    The quantifier structure of sentences that characterize nondeterministic time complexity (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    nondeterministic time complexity
    0 references
    second-order logic
    0 references
    finite models
    0 references