The following pages link to (Q3392273):
Displaying 50 items.
- Reverse complexity (Q287279) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- On the expressive power of behavioral profiles (Q315288) (← links)
- On regular realizability problems for context-free languages (Q327306) (← links)
- Checking interval properties of computations (Q329413) (← links)
- Gaussian quantum computation with oracle-decision problems (Q352994) (← links)
- Deciding unique decodability of bigram counts via finite automata (Q386046) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- A structural/temporal query language for business processes (Q414923) (← links)
- Efficiently identifying deterministic real-time automata from labeled data (Q420918) (← links)
- Reversal of binary regular languages (Q443743) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Permutation reconstruction from differences (Q463039) (← links)
- Book review of: S. Arora and B. Barak, Computational complexity: a modern approach. (Q465661) (← links)
- Verifying time complexity of Turing machines (Q496007) (← links)
- Distinguishing two probability ensembles with one sample from each ensemble (Q503466) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- Log-space conjugacy problem in the Grigorchuk group (Q524647) (← links)
- \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete (Q526872) (← links)
- First-cycle games (Q528186) (← links)
- On the algorithmic complexity of static structures (Q545415) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- A context-free and a 1-counter geodesic language for a Baumslag-Solitar group (Q557909) (← links)
- A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions (Q602636) (← links)
- A study of heuristic guesses for adiabatic quantum computation (Q632202) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- A note on algebras of languages (Q650885) (← links)
- Second-level algorithms, superrecursivity, and recovery problem in distributed systems (Q692890) (← links)
- Statistical estimation with bounded memory (Q693352) (← links)
- Producing and verifying extremely large propositional refutations (Q694550) (← links)
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages (Q703507) (← links)
- Asymptotic granularity reduction and its application (Q719278) (← links)
- Finite state complexity (Q719308) (← links)
- Inverse subsemigroups of finite index in finitely generated inverse semigroups (Q722557) (← links)
- Tradeoff lower lounds for stack machines (Q744614) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
- Admissibility of cut in LC with fixed point combinator (Q817697) (← links)
- Relational semantics for Kleene logic and action logic (Q817963) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- A bypassing path based routing algorithm for the pyramid structures (Q856156) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Prefix-free languages: left and right quotient and reversal (Q896681) (← links)
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable (Q905698) (← links)
- Jug measuring: algorithms and complexity (Q924133) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- On the expressiveness of interaction (Q960859) (← links)
