The following pages link to Andrzej Szepietowski (Q293472):
Displaying 43 items.
- Weak and strong one-way space complexity classes (Q293473) (← links)
- Fault tolerance of edge pancyclicity in alternating group graphs (Q440980) (← links)
- Fault-tolerant edge and vertex pancyclicity in alternating group graphs (Q606860) (← links)
- The element distinctness problem on one-tape Turing machines (Q671603) (← links)
- Fault tolerance of vertex pancyclicity in alternating group graphs (Q716067) (← links)
- A note on the oriented chromatic number of grids (Q834897) (← links)
- A note on alternating one-pebble Turing machines with sublogarithmic space (Q844190) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
- Fooling Turing machines with sublogarithmic space: a note on `For completeness, sublogarithmic space is no space' by M. Agrawal (Q963359) (← links)
- A finite 5-pebble-automaton can search every maze (Q1050773) (← links)
- Remarks on languages acceptable in log log n space (Q1107318) (← links)
- There are no fully space constructible functions between log log n and log n (Q1108005) (← links)
- On three-way two-dimensional Turing machines (Q1116697) (← links)
- On space functions constructed by two-dimensional Turing machines (Q1186366) (← links)
- Two-dimensional on-line tessellation acceptors are not closed under complement (Q1193695) (← links)
- Some remarks on two-dimensional finite automata (Q1193834) (← links)
- Turing machines with sublogarithmic space (Q1338452) (← links)
- (Q1589414) (redirect page) (← links)
- Shuffle languages are in P (Q1589415) (← links)
- Algorithms counting monotone Boolean functions (Q1603481) (← links)
- Hamiltonian cycles in hypercubes with \(2n-4\) faulty edges (Q1761611) (← links)
- Some notes on strong and weak log log n space complexity (Q1824397) (← links)
- Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space (Q1825656) (← links)
- Complexity of weak acceptance conditions in tree automata. (Q1853134) (← links)
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges (Q2234783) (← links)
- Hamiltonian paths in hypercubes with local traps (Q2282293) (← links)
- Signed coloring of 2-dimensional grids (Q2294442) (← links)
- Oriented cliques and colorings of graphs with low maximum degree (Q2305935) (← links)
- The oriented chromatic number of Halin graphs (Q2350598) (← links)
- On three-way two-dimensional multicounter automata (Q2638802) (← links)
- Closure properties of hyper-minimized automata (Q3117549) (← links)
- (Q3316597) (← links)
- (Q3395996) (← links)
- (Q3659140) (← links)
- (Q3704893) (← links)
- Weak mode of space complexity can be used in the proof that \([DSPACE({\l}og{\l}og n)\) = \(NSPACE({\l}og{\l}og n)\)] \(\Rightarrow\) [\(L = NL]\) (Q3971288) (← links)
- On the expressive power of the shuffle operator matched with intersection by regular sets (Q4331053) (← links)
- There is no complete axiom system for shuffle expressions (Q4718894) (← links)
- Lower Space Bounds for Accepting Shuffle Languages (Q4718896) (← links)
- (Q5060306) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n (Q5096159) (← links)
- Membership Problem for Two-Dimensional General Row Jumping Finite Automata (Q5859631) (← links)
- (Q6136025) (← links)
