The following pages link to (Q4298260):
Displayed 50 items.
- 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)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Dimension extractors and optimal decompression (Q1015378) (← links)
- Red-blue covering problems and the consecutive ones property (Q1018089) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Algorithms for compact letter displays: comparison and evaluation (Q1020871) (← links)
- Quantified coalition logic (Q1024128) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Paintshop, odd cycles and necklace splitting (Q1028475) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- AM\(_{\text{exp}}\nsubseteq (\text{NP} \cap \text{coNP})\)/poly (Q1029043) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- The complexity of solitaire (Q1034532) (← links)
- On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls (Q1040040) (← links)
- Systems of agents controlled by logical programs: complexity of verification (Q1040334) (← links)