Filter your results
- 2
- 2
- 2
- 1
- 1
- 2
- 2
|
|
|
sorted by
|
|
|
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?21th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2019, Košice, Slovakia. pp.285-297, ⟨10.1007/978-3-030-23247-4_22⟩
Conference papers
hal-02387305v1
|
||
|
|
State Complexity Characterizations of Parameterized Degree-Bounded Graph Connectivity, Sub-Linear Space Computation, and the Linear Space Hypothesis20th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2018, Halifax, NS, Canada. pp.237-249, ⟨10.1007/978-3-319-94631-3_20⟩
Conference papers
hal-01905627v1
|