The following pages link to (Q4298260):
Displayed 50 items.
- The complexity of the \(K\)th largest subset problem and related problems (Q894449) (← links)
- On the complexity of sampling query feedback restricted database repair of functional dependency violations (Q896157) (← links)
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- Theory of interaction (Q896903) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- Combined-semantics equivalence of conjunctive queries: decidability and tractability results (Q899579) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- The complexity of reasoning with FODD and GFODD (Q900300) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- On the complexity of bribery and manipulation in tournaments with uncertain information (Q901143) (← links)
- Extended RDF: computability and complexity issues (Q905991) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Relations between average-case and worst-case complexity (Q927398) (← links)
- Martingale families and dimension in P (Q930913) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
- Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs (Q935835) (← links)
- Random subcubes as a toy model for constraint satisfaction problems (Q937116) (← links)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Solutions to computational problems through gene assembly (Q941688) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- On the computational complexity of the Riemann mapping (Q942023) (← links)
- Undoing the effects of action sequences (Q946576) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Universal relations and {\#}P-completeness (Q954984) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- Resource-bounded measure on probabilistic classes (Q963376) (← links)
- Translating propositional extended conjunctions of Horn clauses into Boolean circuits (Q964389) (← links)
- A computational analysis of the tournament equilibrium set (Q964822) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- On the autoreducibility of functions (Q970103) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- General default logic (Q987485) (← links)
- A new default theories compilation for MSP-entailment (Q989883) (← links)
- Reasoning under inconsistency: a forgetting-based approach (Q991019) (← links)
- The complexity of power-index comparison (Q1001906) (← links)
- Approximability of partitioning graphs with supply and demand (Q1002107) (← links)
- A note on the distribution of the distance from a lattice (Q1006407) (← links)
- Knowledge condition games (Q1006447) (← links)
- A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
- Complexity of the problem of verifying the coordination mechanism in a system of software support of network collaboration (Q1007157) (← links)
- The hardest linear conjunctive language (Q1007613) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Random walks for selected Boolean implication and equivalence problems (Q1014275) (← links)