On the public citation graph
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
0 signed · 188 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1949.tb03624.xopenalex-snapshot
The Synthesis of Two-Terminal Switching Circuits
inferredcites →https://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_13openalex-snapshot
Reformulation and Decomposition of Integer Programs
inferredcites →https://doi.org/10.1007/978-3-642-03685-9_10openalex-snapshot
Optimal Sherali-Adams Gaps from Pairwise Independence
inferredcites →https://doi.org/10.1007/978-3-642-04295-9openalex-snapshot
Geometry of Cuts and Metrics
inferredcites →https://doi.org/10.1007/978-3-642-13036-6_11openalex-snapshot
Symmetry Matters for the Sizes of Extended Formulations
inferredcites →https://doi.org/10.1007/978-3-642-13036-6_23openalex-snapshot
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
inferredcites →https://doi.org/10.1007/978-3-642-32147-4_13openalex-snapshot
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols
inferredcites →https://doi.org/10.1007/978-3-642-39206-1_6openalex-snapshot
On the Extension Complexity of Combinatorial Polytopes
inferredcites →https://doi.org/10.1007/978-3-642-40450-4_19openalex-snapshot
On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
inferredcites →https://doi.org/10.1007/bf01581273openalex-snapshot
A lift-and-project cutting plane algorithm for mixed 0–1 programs
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/s00037-016-0125-zopenalex-snapshot
Information-theoretic approximations of the nonnegative rank
inferredcites →https://doi.org/10.1007/s00454-014-9655-9openalex-snapshot
A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
inferredcites →https://doi.org/10.1007/s00493-012-2746-4openalex-snapshot
A counterexample to the Alon-Saks-Seymour conjecture and related problems
inferredcites →https://doi.org/10.1007/s10107-012-0574-3openalex-snapshot
Some 0/1 polytopes need exponential size extended formulations
inferredcites →https://doi.org/10.1007/s10107-016-0989-3openalex-snapshot
Average case polyhedral complexity of the maximum stable set problem
inferredcites →https://doi.org/10.1007/s10288-010-0122-zopenalex-snapshot
Extended formulations in combinatorial optimization
inferredcites →https://doi.org/10.1007/s10479-012-1269-0openalex-snapshot
Extended formulations in combinatorial optimization
inferredcites →https://doi.org/10.1016/0012-365x(90)90056-nopenalex-snapshot
The cut polytope and the Boolean quadric polytope
inferredcites →https://doi.org/10.1016/0022-0000(91)90024-yopenalex-snapshot
Expressing combinatorial optimization problems by Linear Programs
inferredcites →https://doi.org/10.1016/0022-0000(93)90035-uopenalex-snapshot
Communication complexity and combinatorial lattice theory
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0304-3975(92)90260-mopenalex-snapshot
On the distributional complexity of disjointness
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.007openalex-snapshot
Exponential lower bound for 2-query locally decodable codes via a quantum argument
inferredcites →https://doi.org/10.1016/j.orl.2013.03.010openalex-snapshot
A note on the extension complexity of the knapsack polytope
inferredcites →https://doi.org/10.1016/s0304-3975(02)00377-8openalex-snapshot
Quantum communication and complexity
inferredcites →https://doi.org/10.1103/revmodphys.82.665openalex-snapshot
Nonlocality and communication complexity
inferredcites →https://doi.org/10.1109/focs.2009.15openalex-snapshot
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection
inferredcites →https://doi.org/10.1109/focs.2012.10openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferredcites →https://doi.org/10.1109/focs.2013.45openalex-snapshot
Approximate Constraint Satisfaction Requires Large LP Relaxations
inferredcites →https://doi.org/10.1109/focs.2013.79openalex-snapshot
Common Information and Unique Disjointness
inferredcites →https://doi.org/10.1109/tit.1979.1055985openalex-snapshot
On the Shannon capacity of a graph
inferredcites →https://doi.org/10.1109/tit.2013.2258372openalex-snapshot
Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States
inferredcites →https://doi.org/10.1119/1.1463744openalex-snapshot
Quantum Computation and Quantum Information
inferredcites →https://doi.org/10.1137/0403036openalex-snapshot
A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
inferredcites →https://doi.org/10.1137/0606047openalex-snapshot
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
inferredcites →https://doi.org/10.1137/0801013openalex-snapshot
Cones of Matrices and Set-Functions and 0–1 Optimization
inferredcites →https://doi.org/10.1137/080721479openalex-snapshot
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy
inferredcites →https://doi.org/10.1137/s0097539702407345openalex-snapshot
Nondeterministic Quantum Query and Communication Complexities
inferredcites →https://doi.org/10.1137/s0097539704447237openalex-snapshot
Lower Bounds for Local Search by Quantum Arguments
inferredcites →https://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferredcites →https://doi.org/10.1145/1250790.1250836openalex-snapshot
Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut
inferredcites →https://doi.org/10.1145/1536414.1536455openalex-snapshot
Integrality gaps for Sherali-Adams relaxations
inferredcites →https://doi.org/10.1145/1536414.1536479openalex-snapshot
On the complexity of communication complexity
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1145/230514.571645openalex-snapshot
Introduction to the Theory of Computation
inferredcites →https://doi.org/10.1145/2488608.2488629openalex-snapshot
An information complexity approach to extended formulations
inferredcites →https://doi.org/10.1145/2591796.2591834openalex-snapshot
The matching polytope has exponential extension complexity
inferredcites →https://doi.org/10.1145/2746539.2746599openalex-snapshot
Lower Bounds on the Size of Semidefinite Programming Relaxations
inferredcites →https://doi.org/10.1145/62212.62232openalex-snapshot
Expressing combinatorial optimization problems by linear programs
inferredcites →https://doi.org/10.1145/780542.780560openalex-snapshot
Exponential lower bound for 2-query locally decodable codes via a quantum argument
inferredcites →https://doi.org/10.1287/moor.1120.0575openalex-snapshot
Lifts of Convex Sets and Cone Factorizations
inferredcites →https://doi.org/10.23883/ijrter.2018.4156.axkviopenalex-snapshot
An Introduction of Theory of Computation
inferredcites →https://doi.org/10.48550/arxiv.1104.1023openalex-snapshot
Extended Formulations in Combinatorial Optimization
inferredcites →https://doi.org/10.48550/arxiv.1105.4127openalex-snapshot
Extended formulations, non-negative factorizations and randomized communication protocols
inferredcites →https://doi.org/10.48550/arxiv.1111.0444openalex-snapshot
Combinatorial Bounds on Nonnegative Rank and Extended Formulations
inferredcites →https://doi.org/10.48550/arxiv.1203.3961openalex-snapshot
Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix
inferredcites →https://doi.org/10.48550/arxiv.1204.0957openalex-snapshot
Approximation Limits of Linear Programs (Beyond Hierarchies)
inferredcites →https://doi.org/10.48550/arxiv.1302.2340openalex-snapshot
On the extension complexity of combinatorial polytopes
inferredcites →https://doi.org/10.48550/arxiv.1305.3268openalex-snapshot
On the existence of 0/1 polytopes with high semidefinite extension complexity
inferredcites →https://doi.org/10.48550/arxiv.1310.4125openalex-snapshot
Generalised probabilistic theories and conic extensions of polytopes
inferredcites →https://doi.org/10.48550/arxiv.1311.2571openalex-snapshot
Exponential lower bounds on fixed-size psd rank and semidefinite extension complexity
inferredcites →https://doi.org/10.5860/choice.45-4430openalex-snapshot
Quantum computer science: an introduction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-22629-9_26openalex-snapshot
Simulated Annealing Approach to Verify Vertex Adjacencies in the Traveling Salesperson Polytope
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_742-1openalex-snapshot
Noncommutative Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_23openalex-snapshot
On the Complexity of Some Facet-Defining Inequalities of the QAP-Polytope
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_8openalex-snapshot
On Permuting Some Coordinates of Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_10openalex-snapshot
A Polyhedral Perspective on Tropical Convolutions
inferred← citeshttps://doi.org/10.1007/978-3-031-38659-6_5openalex-snapshot
Matrix Factorization Ranks Via Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_28openalex-snapshot
Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-031-59835-7_9openalex-snapshot
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-319-34171-2_18openalex-snapshot
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_17openalex-snapshot
On Integer Recognition over Some Boolean Quadric Polytope Extension
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_23openalex-snapshot
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks
inferred← citeshttps://doi.org/10.1007/978-3-319-45587-7_5openalex-snapshot
The Parity Hamiltonian Cycle Problem in Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-51741-4openalex-snapshot
Approximation and Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_38openalex-snapshot
Nondeterministic Communication Complexity of Random Boolean Functions (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_6openalex-snapshot
Extension Complexity of Stable Set Polytopes of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-93800-4_13openalex-snapshot
On Vertices of the Simple Boolean Quadric Polytope Extension
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_21openalex-snapshot
The Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/s00037-016-0125-zopenalex-snapshot
Information-theoretic approximations of the nonnegative rank
inferred← citeshttps://doi.org/10.1007/s00037-016-0126-yopenalex-snapshot
Multipartite Quantum Correlation and Communication Complexities
inferred← citeshttps://doi.org/10.1007/s00224-016-9740-yopenalex-snapshot
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00224-019-09951-xopenalex-snapshot
Extension Complexity of Formal Languages
inferred← citeshttps://doi.org/10.1007/s00454-017-9925-4openalex-snapshot
Extension Complexity and Realization Spaces of Hypersimplices
inferred← citeshttps://doi.org/10.1007/s00454-018-9988-xopenalex-snapshot
Euclidean Distance Matrices and Separations in Communication Complexity Theory
inferred← citeshttps://doi.org/10.1007/s00454-022-00419-3openalex-snapshot
On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube
inferred← citeshttps://doi.org/10.1007/s00454-023-00522-zopenalex-snapshot
Lifts for Voronoi Cells of Lattices
inferred← citeshttps://doi.org/10.1007/s10107-016-0989-3openalex-snapshot
Average case polyhedral complexity of the maximum stable set problem
inferred← citeshttps://doi.org/10.1007/s10107-016-1052-0openalex-snapshot
Some upper and lower bounds on PSD-rank
inferred← citeshttps://doi.org/10.1007/s10107-016-1098-zopenalex-snapshot
The matching problem has no small symmetric SDP
inferred← citeshttps://doi.org/10.1007/s10107-017-1198-4openalex-snapshot
Completely positive semidefinite rank
inferred← citeshttps://doi.org/10.1007/s10107-018-01358-9openalex-snapshot
Balas formulation for the union of polytopes is optimal
inferred← citeshttps://doi.org/10.1007/s10107-020-01502-4openalex-snapshot
Separation routine and extended formulations for the stable set problem in claw-free graphs
inferred← citeshttps://doi.org/10.1007/s10107-020-01542-wopenalex-snapshot
Strengthening convex relaxations of 0/1-sets using Boolean formulas
inferred← citeshttps://doi.org/10.1007/s10107-020-01563-5openalex-snapshot
New limits of treewidth-based tractability in optimization
inferred← citeshttps://doi.org/10.1007/s10107-021-01706-2openalex-snapshot
Worst-case analysis of clique MIPs
inferred← citeshttps://doi.org/10.1007/s10107-023-01994-wopenalex-snapshot
The role of rationality in integer-programming relaxations
inferred← citeshttps://doi.org/10.1007/s10107-023-02015-6openalex-snapshot
Multiplicative updates for symmetric-cone factorizations
inferred← citeshttps://doi.org/10.1007/s10107-025-02234-zopenalex-snapshot
Lower bounds on the complexity of mixed-integer programs for stable set and knapsack
inferred← citeshttps://doi.org/10.1007/s10208-018-09410-yopenalex-snapshot
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/s10618-019-00669-5openalex-snapshot
Parameterized low-rank binary matrix approximation
inferred← citeshttps://doi.org/10.1007/s11856-023-2517-5openalex-snapshot
Around the log-rank conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.042openalex-snapshot
Parameterized extension complexity of independent set and related problems
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.038openalex-snapshot
Volume computation for sparse Boolean quadric relaxations
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.016openalex-snapshot
Polynomial size linear programs for problems in P
inferred← citeshttps://doi.org/10.1016/j.disc.2017.10.025openalex-snapshot
The parity Hamiltonian cycle problem
inferred← citeshttps://doi.org/10.1016/j.disopt.2016.04.005openalex-snapshot
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100825openalex-snapshot
Circuits in extended formulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.014openalex-snapshot
On the linear extension complexity of stable set polytopes for perfect graphs
inferred← citeshttps://doi.org/10.1016/j.jmp.2018.08.003openalex-snapshot
Extended formulations for order polytopes through network flows
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102299openalex-snapshot
Tensor decompositions on simplicial complexes with invariance
inferred← citeshttps://doi.org/10.1016/j.orl.2016.03.008openalex-snapshot
Extended formulations for vertex cover
inferred← citeshttps://doi.org/10.1016/j.orl.2018.03.008openalex-snapshot
On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
inferred← citeshttps://doi.org/10.1016/j.orl.2018.12.001openalex-snapshot
Extension complexity of the correlation polytope
inferred← citeshttps://doi.org/10.1016/j.orl.2020.05.008openalex-snapshot
On the extension complexity of scheduling polytopes
inferred← citeshttps://doi.org/10.1016/j.orl.2021.03.006openalex-snapshot
Pitch, extension complexity, and covering problems
inferred← citeshttps://doi.org/10.1016/j.orl.2021.11.006openalex-snapshot
Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes
inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.011openalex-snapshot
Extended formulations for matroid polytopes through randomized protocols
inferred← citeshttps://doi.org/10.1080/09720529.2020.1732084openalex-snapshot
Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes
inferred← citeshttps://doi.org/10.1080/10556788.2020.1864370openalex-snapshot
Sparktope: linear programs from algorithms
inferred← citeshttps://doi.org/10.1090/pspum/111/02040openalex-snapshot
The nonlinear algebra view of discrete mathematics
inferred← citeshttps://doi.org/10.1090/tran/8614openalex-snapshot
Extension complexity of low-dimensional polytopes
inferred← citeshttps://doi.org/10.1103/physreva.94.042125openalex-snapshot
Device-independent dimension tests in the prepare-and-measure scenario
inferred← citeshttps://doi.org/10.1103/physreva.95.012340openalex-snapshot
Shared randomness and device-independent dimension witnessing
inferred← citeshttps://doi.org/10.1103/physrevlett.117.060401openalex-snapshot
Minimum Dimension of a Hilbert Space Needed to Generate a Quantum Correlation
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447134openalex-snapshot
Information theory and polyhedral combinatorics
inferred← citeshttps://doi.org/10.1109/focs.2016.67openalex-snapshot
Extension Complexity of Independent Set Polytopes
inferred← citeshttps://doi.org/10.1134/s1990478916030078openalex-snapshot
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch75openalex-snapshot
The matching problem has no small symmetric SDP
inferred← citeshttps://doi.org/10.1137/17m1152966openalex-snapshot
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs
inferred← citeshttps://doi.org/10.1137/20m1324417openalex-snapshot
Lifting for Simplicity: Concise Descriptions of Convex Sets
inferred← citeshttps://doi.org/10.1137/22m1507486openalex-snapshot
Piecewise Polyhedral Relaxations of Multilinear Optimization
inferred← citeshttps://doi.org/10.1137/24m1652027openalex-snapshot
Binary Cyclic Transversal Polytopes
inferred← citeshttps://doi.org/10.1142/s0219498824500257openalex-snapshot
Complex psd-minimal polytopes in dimensions two and three
inferred← citeshttps://doi.org/10.1145/3055399.3055438openalex-snapshot
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs
inferred← citeshttps://doi.org/10.1145/3170711openalex-snapshot
Randomized Communication versus Partition Number
inferred← citeshttps://doi.org/10.1145/3313276.3316353openalex-snapshot
The Log-Approximate-Rank Conjecture Is False
inferred← citeshttps://doi.org/10.1145/3337787openalex-snapshot
Representations of Monotone Boolean Functions by Linear Programs
inferred← citeshttps://doi.org/10.1145/3519935.3519965openalex-snapshot
Positive spectrahedra: invariance principles and pseudorandom generators
inferred← citeshttps://doi.org/10.1145/3798129.3800911openalex-snapshot
Negations Are Powerful Even in Small Depth
inferred← citeshttps://doi.org/10.12783/dtetr/amma2017/13349openalex-snapshot
Research on Weighing Strategy of Vehicle Entering Plant Based on Fuzzy Operation Time
inferred← citeshttps://doi.org/10.1287/ijoc.2023.1268openalex-snapshot
Synergies Between Operations Research and Quantum Information Science
inferred← citeshttps://doi.org/10.1287/moor.2017.0918openalex-snapshot
No Small Linear Program Approximates Vertex Cover Within a Factor 2 − ɛ
inferred← citeshttps://doi.org/10.1287/moor.2020.1077openalex-snapshot
On Polyhedral Approximations of the Positive Semidefinite Cone
inferred← citeshttps://doi.org/10.1287/moor.2021.1219openalex-snapshot
Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
inferred← citeshttps://doi.org/10.17169/refubium-17593openalex-snapshot
On k-level matroids: geometry and combinatorics
inferred← citeshttps://doi.org/10.23638/dmtcs-22-4-8openalex-snapshot
Extension Complexity, MSO Logic, and Treewidth
inferred← citeshttps://doi.org/10.3390/logistics10030063openalex-snapshot
A Θ(m9) Ternary Minimum-Cost Network Flow LP Model of the Assignment Problem Polytope, with Applications to Hard Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.17openalex-snapshot
On the Sum-of-Squares Degree of Symmetric Quadratic Functions
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2021.61openalex-snapshot
Communication Memento: Memoryless Communication Complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1410.7082openalex-snapshot
Complexity of LP in Terms of the Face Lattice
inferred← citeshttps://doi.org/10.48550/arxiv.1605.03243openalex-snapshot
On "Exponential Lower Bounds for Polytopes in Combinatorial Optimization" by Fiorini et al. (2015): A Refutation For Models With Disjoint Sets of Descriptive Variables
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01645openalex-snapshot
Some characteristics of the simple Boolean quadric polytope extension
inferred← citeshttps://doi.org/10.48550/arxiv.1611.08400openalex-snapshot
Nondeterministic Communication Complexity of Random Boolean Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1704.06170openalex-snapshot
Boolean quadric polytopes are faces of linear ordering polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1708.01573openalex-snapshot
Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03549openalex-snapshot
On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims
inferred← citeshttps://doi.org/10.48550/arxiv.1902.10271openalex-snapshot
On the extension complexity of scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00164openalex-snapshot
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1910.02573openalex-snapshot
Convexification of Permutation-Invariant Sets and an Application to Sparse PCA
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00293openalex-snapshot
A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations
inferred← citeshttps://doi.org/10.48550/arxiv.2310.00724openalex-snapshot
Subtractive Mixture Models via Squaring: Representation and Learning
inferred← citeshttps://doi.org/10.70675/0e4f7c36zeceaz4860zbf21z776ee67d278dopenalex-snapshot
Robust state estimation for switched systems : application to fault detection
inferred← citeshttps://doi.org/10.70675/1df55becz00c9z405ez9532z03e3c11f7169openalex-snapshot
The stochastic shortest path problem and its variations : foundations and applications to sport strategy optimization
inferred← citeshttps://doi.org/10.70675/22232f00zc154z4403z9ad9zb300629d8110openalex-snapshot
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.