The complexity of computing the permanent
From MaRDI portal
Publication:600247
Cites work
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3557236 (Why is no real title available?)
- scientific article; zbMATH DE number 3569828 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3419161 (Why is no real title available?)
- A characterization of convertible (0,1)-matrices
- A lower bound on the number of additions in monotone computations
- A method for obtaining digital signatures and public-key cryptosystems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Distinct Representatives
- Every Prime Has a Succinct Certificate
- Gaussian elimination is not optimal
- On the computational power of pushdown automata
- On the relation between the determinant and the permanent
- Relative complexity of checking and evaluating
- The Complexity of Enumeration and Reliability Problems
- The complexity of theorem-proving procedures
- The polynomial-time hierarchy
Cited in
(only showing first 100 items - show all)- Solution Counting Algorithms for Constraint-Centered Search Heuristics
- On the permanental polynomials of matrices
- On the parameterized complexity of approximate counting
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- Counting problems over the reals
- Locating \(P\)/poly optimally in the extended low hierarchy
- On the coefficients of the permanent and the determinant of a circulant matrix: applications
- An asymptotic approximation for the permanent of a doubly stochastic matrix
- Parameterized counting problems
- On the closure of certain function classes under integer division by polynomially-bounded functions
- On testing Hamiltonicity of graphs
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs
- Singular spaces of matrices and their application in combinatorics
- Counting problems and ranks of matrices
- Cycle-maximal triangle-free graphs
- Leveraging belief propagation, backtrack search, and statistics for model counting
- Counting maximal independent sets in directed path graphs
- On some natural complete operators
- Algorithms to count paths and cycles
- An efficient algorithm for computing permanental polynomials of graphs
- On the Gibson barrier for the Pólya problem
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- Farrell polynomials on graphs of bounded tree width
- Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems
- Extending matchings in claw-free graphs
- On the Pólya conversion problem for permanents and determinants
- The complexity to compute the Euler characteristic of complex varieties
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Identities between dimer partition functions on different surfaces
- Complexity and approximability of the cover polynomial
- The complexity of computational problems about Nash equilibria in symmetric win-lose games
- A linear-optical proof that the permanent is \(\#\mathrm{P}\)-hard
- Permanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Matching signatures and Pfaffian graphs
- Optical solution for hard on average \#P-complete instances (using exponential space for solving instances of the permanent)
- Counting classes: Thresholds, parity, mods, and fewness
- Permanent does not have succinct polynomial size arithmetic circuits of constant depth
- The complexity of symmetric Boolean parity Holant problems (extended abstract)
- On the autoreducibility of functions
- An efficient tree decomposition method for permanents and mixed discriminants
- Division in idealized unit cost RAMs
- Maximal independent sets in caterpillar graphs
- On sparse hard sets for counting classes
- The parameterized complexity of probability amplification
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Matrix permanent and quantum entanglement of permutation invariant states
- Gap-definable counting classes
- Robust planning with incomplete domain models
- Brace generation
- Counting perfect matchings in \(n\)-extendable graphs
- A note on SpanP functions
- Theory of one-tape linear-time Turing machines
- Finding a shortest non-zero path in group-labeled graphs via permanent computation
- Counting the number of perfect matchings in \(K_{5}\)-free graphs
- Maximum matchings in scale-free networks with identical degree distribution
- Lower bounds against weakly-uniform threshold circuits
- Relative entropy optimization and its applications
- Lee-Yang theorems and the complexity of computing averages
- On the permanents of circulant and degenerate Schur matrices
- Maximal independent sets in a generalisation of caterpillar graph
- Algorithms for Propositional Model Counting
- Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs
- Average-case intractability vs. worst-case intractability
- A note on the permanental roots of bipartite graphs
- Complexity of Counting the Optimal Solutions
- Algorithms for four variants of the exact satisfiability problem
- On the power of generalized Mod-classes
- The consequences of eliminating NP solutions
- No occurrence obstructions in geometric complexity theory
- Mathematical aspects of concept analysis
- Explaining by evidence
- Finding all maximally-matchable edges in a bipartite graph
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Counting models for 2SAT and 3SAT formulae
- Counting perfect matchings as fast as Ryser
- Weighted enumeration of spanning subgraphs in locally tree-like graphs
- On the complexity of inconsistency measurement
- The ubiquitous Ewens sampling formula
- On the hardness of approximate reasoning
- Dimers on graphs in non-orientable surfaces
- Multi-boson correlation sampling
- A mildly exponential approximation algorithm for the permanent
- On the counting complexity of propositional circumscription
- Sampling of bosonic qubits
- Unification algorithms cannot be combined in polynomial time
- Non-deterministic exponential time has two-prover interactive protocols
- Scaling matrices and counting the perfect matchings in graphs
- A permanent formula with many zero-valued terms
- Bayesian incentive compatibility via matchings
- Computing the permanental polynomials of bipartite graphs by Pfaffian orientation
- The minimal \(k\)-core problem for modeling \(k\)-assemblies
- Approximately counting embeddings into random graphs
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- Complexity of counting the optimal solutions
- On the skew-permanental polynomials of orientation graphs
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs
- Computing the partition function for perfect matchings in a hypergraph
- Computing the permanent of (some) complex matrices
- Binary determinantal complexity
This page was built for publication: The complexity of computing the permanent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q600247)
