Pages that link to "Item:Q2307493"
From MaRDI portal
The following pages link to Compact quadratizations for pseudo-Boolean functions (Q2307493):
Displaying 15 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- A decomposition method for minimizing quadratic pseudo-Boolean functions (Q1118533) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Quadratic sequential computations of Boolean mappings (Q1882535) (← links)
- Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions (Q5447509) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- New advances for quantum-inspired optimization (Q6609695) (← links)
- Reduction-based MAX-3SAT with low nonlinearity and lattices under recombination (Q6635982) (← links)
- Quantum computing and tensor networks for laminate design: a novel approach to stacking sequence retrieval (Q6641922) (← links)
