The following pages link to (Q4198056):
Displaying 50 items.
- An algorithm for the three-dimensional packing problem with asymptotic performance analysis (Q679456) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- Complexity of the satisfiability problem for multilinear forms over a finite field (Q682219) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard (Q685336) (← links)
- Removing redundancy from a clause (Q685346) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Monadic second-order evaluations on tree-decomposable graphs (Q685464) (← links)
- Computational limitations on training sigmoid neural networks (Q685499) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527) (← links)
- The complexity of path-based defeasible inheritance (Q685542) (← links)
- Coloring a graph optimally with two colors (Q685594) (← links)
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- A note on a counting problem arising in percolation theory (Q685697) (← links)
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- A greedy heuristic for 3-partitioning with similar elements (Q685863) (← links)
- Stable sets versus independent sets (Q686148) (← links)
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- Efficient sets in graphs (Q686251) (← links)
- A linear algorithm for the group path problem on chordal graphs (Q686257) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- On existence theorems (Q686508) (← links)
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- An improved branch and bound algorithm for minimum concave cost network flow problems (Q686988) (← links)
- Single machine scheduling with flow time and earliness penalties (Q686991) (← links)
- Deciding uniqueness in norm maximazation (Q687086) (← links)
- Improving known solutions is hard (Q687508) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- The even and odd cut polytopes (Q688256) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Low-complexity aggregation in GraphLog and Datalog (Q688669) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- An on-line algorithm for multidimensional bin packing (Q688930) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Geometric Knapsack problems (Q689105) (← links)
- Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
