The following pages link to (Q4298260):
Displayed 50 items.
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Fundamentals of quantum information theory (Q699526) (← links)
- Average-case complexity and decision problems in group theory. (Q703812) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- Trading polarizations for labels in P systems with active membranes (Q707497) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Probabilistic logic under coherence: complexity and algorithms (Q819942) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- On the role of Hadamard gates in quantum circuits (Q850548) (← links)
- Strong order equivalence (Q854968) (← links)
- Equilibrium logic (Q854969) (← links)
- On the tree-transformation power of XSLT (Q855270) (← links)
- Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Complexity of admissible rules (Q868660) (← links)
- An efficient fixed-parameter algorithm for 3-hitting set (Q876698) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Fast algorithms for robust classification with Bayesian nets (Q881796) (← links)
- A new construction technique of a triangle-free 3-colored K16's (Q881858) (← links)
- An efficient modular method for the control of concurrent discrete event systems: A language-based approach (Q884762) (← links)
- Social laws in alternating time: effectiveness, feasibility, and synthesis (Q885535) (← 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)
- 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)