Pages that link to "Item:Q5339741"
From MaRDI portal
The following pages link to On the Computational Complexity of Algorithms (Q5339741):
Displayed 50 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- Reverse complexity (Q287279) (← links)
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- Some remarks on real numbers induced by first-order spectra (Q306827) (← links)
- On uniformity and circuit lower bounds (Q488049) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Computability and complexity in self-assembly (Q537904) (← links)
- The strong exponential hierarchy collapses (Q584250) (← links)
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\) (Q673644) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- On the power of several queues (Q685436) (← links)
- Linear speed-up does not hold on Turing machines with tree storages (Q688445) (← links)
- A speed-up theorem without tape compression (Q688718) (← links)
- Complexity results for deciding networks of evolutionary processors (Q714866) (← links)
- Resource restricted computability theoretic learning: Illustrative topics and problems (Q733738) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- A formalization of multi-tape Turing machines (Q744986) (← links)
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes (Q756423) (← links)
- Data structures for distributed counting (Q794431) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- Time hierarchies for cryptographic function inversion with advice (Q843601) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- Complexity-theoretic algebra. II: Boolean algebras (Q915723) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- When is arithmetic possible? (Q922533) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Translational lemmas for DLOGTIME-uniform circuits, alternating TMs, and PRAMs (Q995752) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- On the structure of one-tape nondeterministic Turing machine time hierarchy (Q1082813) (← links)
- Tape versus queue and stacks: The lower bounds (Q1109567) (← links)
- Simulating two pushdown stores by one tape in \(O(n^{1.5}\,\sqrt{\log \,n})\) time (Q1113670) (← links)
- A note on the best-case complexity (Q1120281) (← links)
- Completeness proofs for propositional logic with polynomial-time connectives (Q1123883) (← links)
- Indirect addressing and the time relationships of some models of sequential computation (Q1140427) (← links)
- On time versus space. II (Q1152954) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Complexity results for classes of quantificational formulas (Q1157324) (← links)
- Unprovability of theorems of complexity theory in weak number theories (Q1162506) (← links)
- Some results on relativized deterministic and nondeterministic time hierarchies (Q1162808) (← links)
- Simulations among multidimensional Turing machines (Q1165001) (← links)
- An analysis of fixed-point queries on binary trees (Q1183571) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- Diagonalization, uniformity, and fixed-point theorems (Q1201287) (← links)
- Hierarchies of Turing machines with restricted tape alphabet size (Q1218271) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Translational lemmas, polynomial time, and \((\log n)^j\)-space (Q1225932) (← links)