Pages that link to "Item:Q3318756"
From MaRDI portal
The following pages link to The Spectra of First-Order Sentences and Computational Complexity (Q3318756):
Displaying 10 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- First-order spectra with one variable (Q909462) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- First-order spectra with one binary predicate (Q1350533) (← links)
- On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
- Universal quantifiers and time complexity of random access machines (Q3699679) (← links)
- Computing on structures (Q4630296) (← links)
- (Q4643954) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Regular Graphs and the Spectra of Two-Variable Logic with Counting (Q5258916) (← links)
