The following pages link to (Q3815544):
Displayed 35 items.
- Extending inclusion dependencies with conditions (Q386615) (← links)
- Mediated population protocols (Q533894) (← links)
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- Language-theoretic problems arising from Richelieu cryptosystems (Q685369) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- The method of forced enumeration for nondeterministic automata (Q1099620) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- Space bounded computations: Review and new separation results (Q1176238) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- An NL hierarchy (Q1182111) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Some properties of space-bounded synchronized alternating Turing machines with universal states only (Q1184994) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- Sparse hard sets for P: Resolution of a conjecture of Hartmanis (Q1288202) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits (Q1566723) (← links)
- Resolution of Hartmanis' conjecture for NL-hard sparse sets (Q1575434) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Self-reducibility (Q2639637) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- Complexity of boundary graph languages (Q3479528) (← links)
- Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata (Q3816981) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines (Q4020492) (← links)
- Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access (Q4032302) (← links)
- Random walks on colored graphs (Q4286296) (← links)
- A note on read-$k$ times branching programs (Q4362278) (← links)
- On the power of parity polynomial time (Q5750401) (← links)