The following pages link to (Q4298260):
Displayed 50 items.
- The complexity of the list homomorphism problem for graphs (Q693060) (← 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)
- Algorithms and time complexity of the request-service problem (Q711403) (← links)
- Complexity and organizational architecture (Q712480) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Complexity results for deciding networks of evolutionary processors (Q714866) (← links)
- Stochastic game logic (Q715046) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Modular composition via factorization (Q722764) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Complexity classes as mathematical axioms (Q731212) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- On complete one-way functions (Q734307) (← links)
- Generic case completeness (Q736607) (← links)
- Rectangular tileability and complementary tileability are undecidable (Q740261) (← links)
- The complexity of one-agent refinement modal logic (Q744988) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- On quasi-inconsistency and its complexity (Q785227) (← links)
- Tropical varieties for exponential sums (Q785323) (← 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)
- Modelling web-service uncertainty: the angel/daemon approach (Q826324) (← links)
- Complexity of limit-cycle problems in Boolean networks (Q831798) (← links)
- A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- In some curved spaces, one can solve NP-hard problems in polynomial time (Q843612) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← 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)