Pages that link to "Item:Q3699679"

The following pages link to Universal quantifiers and time complexity of random access machines (Q3699679):

Displaying 9 items.

• One unary function says less than two in existential second order logic (Q286970) (← links)
• 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)
• Investigation of binary spectra by explicit polynomial transformations of graphs (Q1318703) (← links)
• Invariance properties of RAMs and linear time (Q1327595) (← links)
• First-order spectra with one binary predicate (Q1350533) (← links)
• On the Variable Hierarchy of First-Order Spectra (Q2957699) (← links)
• Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)