The following pages link to Michael Soltys (Q453197):
Displaying 31 items.
- Proving properties of matrices over \({\mathbb{Z}_{2}}\) (Q453198) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Matrix identities and the pigeonhole principle (Q701728) (← links)
- The proof theoretic strength of the Steinitz exchange theorem (Q858298) (← links)
- On the Ehrenfeucht-Mycielski sequence (Q1044039) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- When is the condition of order preservation met? (Q1735187) (← links)
- An improved upper bound and algorithm for clique covers (Q1748206) (← links)
- Weak theories of linear algebra (Q1766923) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- A formal framework for stringology (Q2295636) (← links)
- On normalization of inconsistency indicators in pairwise comparisons (Q2407943) (← links)
- LA, permutations, and the Hajós calculus (Q2581274) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- Berkowitz's algorithm and clow sequences (Q2783464) (← links)
- (Q2819397) (← links)
- Feasible Combinatorial Matrix Theory (Q2849961) (← links)
- Circuit Complexity of Shuffle (Q2870045) (← links)
- (Q2883162) (← links)
- Complex Ranking Procedures (Q2968833) (← links)
- Important Facts and Observations about Pairwise Comparisons (the special issue edition) (Q2968840) (← links)
- (Q4438100) (← links)
- (Q4489064) (← links)
- An Introduction to the Analysis of Algorithms (Q4602026) (← links)
- Non-repetitive Strings over Alphabet Lists (Q5176590) (← links)
- Computer Science Logic (Q5394597) (← links)
- (Q5422267) (← links)
- Automata, Languages and Programming (Q5466547) (← links)
- An Introduction to the Analysis of Algorithms (Q5891518) (← links)
- An Introduction to the Analysis of Algorithms (Q5902089) (← links)
