The following pages link to (Q4198056):
Displayed 50 items.
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Linear algorithms for edge-coloring trees and unicyclic graphs (Q600259) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Two-Dimensional partitioning problems (Q671423) (← links)
- The complexity of subgraph isomorphism for classes of partial k-trees (Q671437) (← links)
- Consistent subsequences and supersequences (Q671514) (← links)
- Strong NP-completeness of a matrix similarity problem (Q671534) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Partitioning a planar assembly into two connected parts is NP-complete (Q672026) (← links)
- Number of models and satisfiability of sets of clauses (Q672138) (← links)
- Reconstructing convex polyominoes from horizontal and vertical projections (Q672143) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Computing with infinitary logic (Q672337) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- The fourth moment in Luby's distribution (Q672385) (← links)
- Iterative improvement of vertex covers (Q672405) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- Complexity results for 1-safe nets (Q672459) (← links)
- Efficient parallel algorithms for doubly convex-bipartite graphs (Q672468) (← links)
- Average case analysis of greedy algorithms for optimisation problems on set systems (Q672472) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- On the information rate of secret sharing schemes (Q672750) (← links)
- Proving nonreachability by modulo-invariants (Q672866) (← links)
- On the approximation of longest common nonsupersequences and shortest common nonsubsequences (Q673078) (← links)
- The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- Approximate triclique coloring for register allocation (Q673230) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Alignment of trees -- an alternative to tree edit (Q673642) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- A note on the complexity of local search problems (Q673814) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- A parallel algorithm for the minimum weighted vertex cover problem (Q674187) (← links)
- An algorithm for finding homogeneous pairs (Q674438) (← links)
- Batch scheduling in a two-machine flow shop with limited buffer (Q674441) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Nondegenerate functions and permutations (Q674920) (← links)
- The complexity of almost-optimal simultaneous coordination (Q675301) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Approximation algorithms for the bandwidth minimization problem for a large class of trees (Q675856) (← links)
- On covering problems of codes (Q675858) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- The real positive semidefinite completion problem for series-parallel graphs (Q676039) (← links)
- Linear interval equations: Computing enclosures with bounded relative or absolute overestimation is NP-hard (Q676167) (← links)
- On the limits of proper learnability of subclasses of DNF formulas (Q676245) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)