Pages that link to "Item:Q4268719"

The following pages link to Lower Bounds in a Parallel Model without Bit Operations (Q4268719):

Displaying 12 items.

• On invariance of degree for certain computations (Q876819) (← links)
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
• Hardness of approximation for knapsack problems (Q2345987) (← links)
• Unifying known lower bounds via geometric complexity theory (Q2351393) (← links)
• Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs (Q2689813) (← links)
• Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
• Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
• On the Symmetries of and Equivalence Test for Design Polynomials. (Q5092415) (← links)
• Shadows of Newton polytopes (Q6076195) (← links)
• Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. (Q6084360) (← links)
• Unifying lower bounds for algebraic machines, semantically (Q6647768) (← links)