The following pages link to Harry R. Lewis (Q800914):
Displaying 27 items.
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- Complexity results for classes of quantificational formulas (Q1157324) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- Unifiability is complete for co-N Log Space (Q1173403) (← links)
- Program schemata and the first-order decision problem (Q1213300) (← links)
- (Q3048806) (← links)
- (Q3315499) (← links)
- The inference problem for template dependencies (Q3340200) (← links)
- (Q3677733) (← links)
- The word problem for cancellation semigroups with zero (Q3712329) (← links)
- A logic for constant-depth circuits (Q3722427) (← links)
- (Q3856727) (← links)
- Satisfiability problems for propositional calculi (Q3864500) (← links)
- (Q3886863) (← links)
- (Q3915990) (← links)
- Conservative reduction classes of Krom formulas (Q3947642) (← links)
- Linear sampling and the ∀∃∀ case of the decision problem (Q4055979) (← links)
- Skolem reduction classes (Q4063431) (← links)
- Description of restricted automata by first-order formulae (Q4077997) (← links)
- Prefix classes of Krom formulas (Q4090321) (← links)
- Renaming a Set of Clauses as a Horn Set (Q4140416) (← links)
- Krom formulas with one dyadic predicate letter (Q4159027) (← links)
- The decision problem for formulas with a small number of atomic subformulas (Q4401431) (← links)
- (Q4554782) (← links)
- (Q4747496) (← links)
- (Q5871898) (← links)
