On the public citation graph
On the Complexity of Mixed Discriminants and Related Problems
0 signed · 79 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/(sici)1098-2418(1999010)14:1<29::aid-rsa2>3.0.co;2-xopenalex-snapshot
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
inferredcites →https://doi.org/10.1007/11549345_39openalex-snapshot
On the Complexity of Mixed Discriminants and Related Problems
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01163285openalex-snapshot
Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
inferredcites →https://doi.org/10.1007/pl00009316openalex-snapshot
Computing Mixed Discriminants, Mixed Volumes, and Permanents
inferredcites →https://doi.org/10.1007/s00454-001-0083-2openalex-snapshot
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary
inferredcites →https://doi.org/10.1007/s004930070007openalex-snapshot
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
inferredcites →https://doi.org/10.1016/0001-8708(81)90044-xopenalex-snapshot
The solution of van der Waerden's problem for permanents
inferredcites →https://doi.org/10.1016/0024-3795(89)90009-8openalex-snapshot
Mixed discriminants of positive semidefinite matrices
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/j.aim.2004.12.002openalex-snapshot
The Van der Waerden conjecture for mixed discriminants
inferredcites →https://doi.org/10.1016/j.jcss.2004.06.003openalex-snapshot
Classical complexity and quantum entanglement
inferredcites →https://doi.org/10.1088/0305-4470/36/19/306openalex-snapshot
Hankel hyperdeterminants and Selberg integrals
inferredcites →https://doi.org/10.1103/physrevlett.91.147902openalex-snapshot
Efficient Classical Simulation of Slightly Entangled Quantum Computations
inferredcites →https://doi.org/10.1137/0222021openalex-snapshot
A Monte-Carlo Algorithm for Estimating the Permanent
inferredcites →https://doi.org/10.1137/s009753970038715xopenalex-snapshot
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
inferredcites →https://doi.org/10.1137/s0097539794278384openalex-snapshot
On The Complexity of Computing Mixed Volumes
inferredcites →https://doi.org/10.1145/1008731.1008738openalex-snapshot
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
inferredcites →https://doi.org/10.1145/335305.335311openalex-snapshot
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
inferredcites →https://doi.org/10.1145/380752.380785openalex-snapshot
Quantum computers that can be simulated classically in polynomial time
inferredcites →https://doi.org/10.1145/780542.780545openalex-snapshot
Classical deterministic complexity of Edmonds' Problem and quantum entanglement
inferredcites →https://doi.org/10.1287/moor.21.1.65openalex-snapshot
Two Algorithmic Results for the Traveling Salesman Problem
inferredcites →https://doi.org/10.48550/arxiv.math/0406420openalex-snapshot
Van der Waerden Conjecture for Mixed Discriminants
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-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/s10208-014-9243-7openalex-snapshot
Computing the Permanent of (Some) Complex Matrices
inferred← citeshttps://doi.org/10.1007/s11128-022-03416-wopenalex-snapshot
A quantum hash function with grouped coarse-grained boson sampling
inferred← citeshttps://doi.org/10.1007/s11856-018-1655-7openalex-snapshot
A stability result using the matrix norm to bound the permanent
inferred← citeshttps://doi.org/10.1016/j.laa.2015.12.004openalex-snapshot
An efficient tree decomposition method for permanents and mixed discriminants
inferred← citeshttps://doi.org/10.1016/j.orl.2021.02.004openalex-snapshot
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate
inferred← citeshttps://doi.org/10.1038/s41467-024-50060-2openalex-snapshot
Large-scale photonic network with squeezed vacuum states for molecular vibronic spectroscopy
inferred← citeshttps://doi.org/10.1038/s41534-023-00791-9openalex-snapshot
Approximating outcome probabilities of linear optical circuits
inferred← citeshttps://doi.org/10.1038/s41566-025-01682-5openalex-snapshot
Experimental quantum-enhanced kernel-based machine learning on a photonic processor
inferred← citeshttps://doi.org/10.1038/s41567-023-02308-9openalex-snapshot
Quantum-inspired classical algorithms for molecular vibronic spectra
inferred← citeshttps://doi.org/10.1038/s41598-018-24302-5openalex-snapshot
Generalized concurrence in boson sampling
inferred← citeshttps://doi.org/10.1080/03081087.2024.2436061openalex-snapshot
New inequalities for permanents and hafnians and some generalizations
inferred← citeshttps://doi.org/10.1088/2040-8986/aae74aopenalex-snapshot
The role of complexity theory in quantum optics—a tutorial for BosonSampling
inferred← citeshttps://doi.org/10.1093/nsr/nwz048openalex-snapshot
Universal bound on sampling bosons in linear optics and its computational implications
inferred← citeshttps://doi.org/10.1103/physreva.101.012303openalex-snapshot
Complexity of full counting statistics of free quantum particles in product states
inferred← citeshttps://doi.org/10.1103/physreva.80.054302openalex-snapshot
Simple encoding of a quantum circuit amplitude as a matrix permanent
inferred← citeshttps://doi.org/10.1103/physreva.96.012322openalex-snapshot
Computational complexity of exterior products and multiparticle amplitudes of noninteracting fermions in entangled states
inferred← citeshttps://doi.org/10.1103/physrevlett.115.070501openalex-snapshot
Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities
inferred← citeshttps://doi.org/10.1109/focs.2017.89openalex-snapshot
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
inferred← citeshttps://doi.org/10.1109/focs.2019.000-3openalex-snapshot
A Tight Analysis of Bethe Approximation for Permanent
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00127openalex-snapshot
Noise and the Frontier of Quantum Supremacy
inferred← citeshttps://doi.org/10.1142/s0219749920500446openalex-snapshot
On the classical complexity of sampling from quantum interference of indistinguishable bosons
inferred← citeshttps://doi.org/10.1145/1944345.1944346openalex-snapshot
On P vs. NP and geometric complexity theory
inferred← citeshttps://doi.org/10.1145/1993636.1993682openalex-snapshot
The computational complexity of linear optics
inferred← citeshttps://doi.org/10.1613/jair.1.13288openalex-snapshot
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
inferred← citeshttps://doi.org/10.19086/da.1244openalex-snapshot
Approximating permanents and hafnians
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2605784/v1openalex-snapshot
Approximating outcome probabilities of linear optical circuits
inferred← citeshttps://doi.org/10.21468/scipostphyscore.8.3.051openalex-snapshot
A field theory representation of sum of powers of principal minors and physical applications
inferred← citeshttps://doi.org/10.22331/q-2020-01-13-223openalex-snapshot
From estimation of quantum probabilities to simulation of quantum circuits
inferred← citeshttps://doi.org/10.22331/q-2021-07-05-496openalex-snapshot
Quantum machine learning with adaptive linear optics
inferred← citeshttps://doi.org/10.22331/q-2024-11-07-1519openalex-snapshot
Phase-space negativity as a computational resource for quantum kernel methods
inferred← citeshttps://doi.org/10.22331/q-2025-07-11-1790openalex-snapshot
Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
inferred← citeshttps://doi.org/10.26421/qic14.7-8-1openalex-snapshot
Generalizing and derandomizing Gurvits's approximation algorithm for the permanent
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2302openalex-snapshot
Complexity Theory and its Applications in Linear Quantum Optics
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2018.19openalex-snapshot
New Hardness Results for the Permanent Using Linear Optics
inferred← citeshttps://doi.org/10.48175/ijarsct-1182openalex-snapshot
Computing The Permanent of (Some) Complex Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1011.3245openalex-snapshot
The Computational Complexity of Linear Optics
inferred← citeshttps://doi.org/10.48550/arxiv.1208.6589openalex-snapshot
Efficient Computation of the Permanent of Block Factorizable Matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1303openalex-snapshot
Computing the permanent of (some) complex matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1601.07518openalex-snapshot
Approximating permanents and hafnians
inferred← citeshttps://doi.org/10.48550/arxiv.1605.00992openalex-snapshot
The Quantum Computer Puzzle (Expanded Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06176openalex-snapshot
New inequalities for permanents and hafnians and some generalizations
inferred← citeshttps://doi.org/10.48550/arxiv.2004.02425openalex-snapshot
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood
inferred← citeshttps://doi.org/10.48550/arxiv.2005.05143openalex-snapshot
An Algorithmic Method of Partial Derivatives
inferred← citeshttps://doi.org/10.48550/arxiv.2102.05227openalex-snapshot
Continuous Variable Quantum Advantages and Applications in Quantum Optics
inferred← citeshttps://doi.org/10.48550/arxiv.2107.13023openalex-snapshot
Perhaps they are everywhere? Undetectable distributed quantum computation and communication for alien civilizations can be established using thermal light from stars
inferred← citeshttps://doi.org/10.48550/arxiv.2111.14148openalex-snapshot
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes
inferred← citeshttps://doi.org/10.48550/arxiv.2202.01861openalex-snapshot
Quantum-inspired classical algorithm for molecular vibronic spectra
inferred← citeshttps://doi.org/10.5555/1109557.1109679openalex-snapshot
The complexity of matrix completion
inferred← citeshttps://doi.org/10.70675/3d77bdc3zadd1z4d1az8ae6zf516db82f794openalex-snapshot
Continuous variable quantum advantages and applications in quantum optics
showing the first 53 of 54 · page through all 54
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.