Pages that link to "Item:Q3477958"
From MaRDI portal
The following pages link to A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958):
Displaying 9 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- Linear time and the power of one first-order universal quantifier (Q1854556) (← links)
- Lower bounds and hardness magnification for sublinear-time shrinking cellular automata (Q2117099) (← links)
- (Q3455999) (← links)
- A Natural NP-Complete Problem with a Nontrivial Lower Bound (Q3796747) (← links)
- Algebraic and logical characterizations of deterministic linear time classes (Q5048946) (← links)