The following pages link to (Q4843270):
Displaying 50 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- On regular realizability problems for context-free languages (Q327306) (← links)
- SAT race 2015 (Q334795) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- The complexity of the bootstraping percolation and other problems (Q393154) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
- Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926) (← links)
- Queries and materialized views on probabilistic databases (Q532366) (← links)
- The computational power of membrane systems under tight uniformity conditions (Q537860) (← links)
- A consequence of a proof of the one-way function existence for the problem of macroscopic superpositions (Q602636) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Query languages for data exchange: beyond unions of conjunctive queries (Q639842) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- Crossing information in two-dimensional sandpiles (Q861291) (← links)
- PSPACE-completeness of majority automata networks (Q897867) (← links)
- Lower bounds on the computational power of an optical model of computation (Q926521) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Computing the minimal covering set (Q943589) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- The complexity of small universal Turing machines: A survey (Q1004087) (← links)
- Boolean circuit programming: A new paradigm to design parallel algorithms (Q1026240) (← links)
- Optical computing (Q1036535) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems (Q1271861) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- The computational complexity of the Lorentz lattice gas (Q1284985) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Predicting nonlinear cellular automata quickly by decomposing them into linear ones (Q1376426) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- Computing Prüfer codes efficiently in parallel (Q1566573) (← links)
- Circuits and expressions with nonassociative gates (Q1567406) (← links)
- Decidability and complexity of simultaneous rigid E-unification with one variable and related results (Q1575636) (← links)
- Randomized OBDD-based graph algorithms (Q1625606) (← links)
- Separability by piecewise testable languages is \textsc{PTime}-complete (Q1698734) (← links)
- Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842) (← links)
- Optimal edge ranking of trees in polynomial time (Q1892584) (← links)
- The parallel complexity of growth models (Q1906438) (← links)
- The computational complexity of generating random fractals (Q1946896) (← links)
- Small space analogues of Valiant's classes and the limitations of skew formulas (Q1947043) (← links)
- On the computational complexity of data flow analysis over finite bounded meet semilattices (Q1981765) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- Parallel computation using active self-assembly (Q2003467) (← links)
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
