The following pages link to (Q4219291):
Displayed 10 items.
- On the complexity of deduction modulo leaf permutative equations (Q556681) (← links)
- A catalog of Boolean concepts. (Q1398363) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- A Story of Hilbert’s Tenth Problem (Q3305317) (← links)
- Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
- On leaf permutative theories and occurrence permutation groups (Q4916222) (← links)