The following pages link to (Q3221403):
Displayed 50 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- Collapse of PP with a semi-random source to BPP (Q286973) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- A characterization of the leaf language classes (Q287160) (← links)
- Languages represented by Boolean formulas (Q290253) (← links)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- Even faster integer multiplication (Q306687) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- On neighborhood-Helly graphs (Q344856) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Complexity-style resources in cryptography (Q385706) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- QTT-rank-one vectors with QTT-rank-one and full-rank Fourier images (Q417446) (← links)
- The set of parameterized \(k\)-covers problem (Q418000) (← links)
- \textsc{Inverse Hamiltonian cycle} and inverse \textsc{3Dimensional matching} are coNP-complete (Q418733) (← links)
- Asynchronous P systems with active membranes (Q418762) (← links)
- Manipulating the quota in weighted voting games (Q420828) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- Cyclic Boolean circuits (Q442202) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- Graph clustering (Q458448) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- The complexity of equivalence, entailment, and minimization in existential positive logic (Q473196) (← links)
- Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods (Q477331) (← links)
- Exploring the tractability border in epistemic tasks (Q484931) (← links)
- Strong conflict-free coloring for intervals (Q487034) (← links)
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Computational complexity of finite asynchronous cellular automata (Q517039) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- Parametric runtime verification is NP-complete and coNP-complete (Q522961) (← links)
- A study on monotone self-dual Boolean functions (Q523743) (← links)
- Mediated population protocols (Q533894) (← links)
- On the complexity of computing winning strategies for finite poset games (Q537910) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
- Belief extrapolation (or how to reason about observations and unpredicted change) (Q543623) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- Leaf languages and string compression (Q550251) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- XML queries and constraints, containment and reformulation (Q555769) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)