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)- New worst-case upper bound for counting exact satisfiability
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts
- A note on the determinant and permanent problem
- Algorithmic uses of the Feferman-Vaught theorem
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Graphs determined by polynomial invariants
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time
- \(2\times 2\) permanental ideals of hypermatrices
- Worst-Case Expected Shortfall with Univariate and Bivariate Marginals
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Computing the permanental polynomials of graphs
- Is there an alternative to parsimonious semantics?
- Counting over non-planar graphs
- A note on graphs with purely imaginary per-spectrum
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- Nilpotent quantum mechanics
- Structure and importance of logspace-MOD class
- Are there elimination algorithms for the permanent?
- Enumerative counting is hard
- Counting perfect matchings and the switch chain
- Exact algorithms for exact satisfiability and number of perfect matchings
- On the (signless) Laplacian permanental polynomials of graphs
- Extremal octagonal chains with respect to the coefficients sum of the permanental polynomial
- Asymptotic evaluation of bosonic probability amplitudes in linear unitary networks in the case of large number of bosons
- Limitations of sums of bounded read formulas and ABPs
- A q-analog of approximation inclusion-exclusion
- A note on \(\#\mathcal P\)-completeness of NP-witnessing relations
- Mining frequent itemsets: a perspective from operations research
- Transducing Markov sequences
- A model for positively correlated count variables
- Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
- An upper bound on the number of high-dimensional permutations
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- On the coefficients of the permanent and the determinant of a circulant matrix: applications
- Calculation of the permanent of a sparse positive matrix
- A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
- Improved approximations for the Erlang loss model
- The minimal \(k\)-core problem for modeling \(k\)-assemblies
- Tally NP sets and easy census functions.
- On the skew-permanental polynomials of orientation graphs
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs
- Computing the permanent of (some) complex matrices
- Binary determinantal complexity
- Lee-Yang theorems and the complexity of computing averages
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- scientific article; zbMATH DE number 7300350 (Why is no real title available?)
- A note on the permanental roots of bipartite graphs
- On the complexity of immanants
- An algorithmic proof of Brégman–Minc theorem
- Tensors in computations
- The Second Immanantal Polynomial and the Centroid of a Graph
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- Estimating the permanent by importance sampling from a finite population
- Generalizations of Opt P to the polynomial hierarchy
- Similarity of personal preferences: Theoretical foundations and empirical analysis
- The complexity of optimization problems
- The fewest clues problem
- On the depth complexity of formulas
- On the Complexity of Holant Problems
- Evaluation and enumeration problems for regular path queries
- Computing small partial coverings
- The complexity of counting models of linear-time temporal logic
- Unification algorithms cannot be combined in polynomial time
- Approximating the permanent of graphs with large factors
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions
- Non-deterministic weighted automata evaluated over Markov chains
- Unicyclic graphs with second largest and second smallest permanental sums
- Counting substrate cycles in topologically restricted metabolic networks
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Counting of Teams in First-Order Team Logics
- Boson-sampling with non-interacting fermions
- Random generation of combinatorial structures from a uniform distribution
- On the number of \(k\)-proper connected edge and vertex colorings of graphs
- Construction of nonconvertible \((0,1)\) matrices
- Noncommutativity makes determinants hard
- Kasteleyn cokernels and perfect matchings on planar bipartite graphs
- The determinant of a fuzzy matrix with respect to \(t\) and co-\(t\) norms
- On the permanent of certain (0,1) Toeplitz matrices
- A permanent formula with many zero-valued terms
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB
- The computational complexity of calculating partition functions of optimal medians with Hamming distance
- Parameterised counting in logspace
- Counting problems in parameterized complexity
- Descriptive complexity for counting complexity classes
- Permanental partition models and Markovian Gibbs structures
- Recursion theoretic characterizations of complexity classes of counting functions
- Nondeterministic NC^1 computation
- On the complexity of convex hulls of subsets of the two-dimensional plane
- NC algorithms for computing a perfect matching and a maximum flow in one-crossing-minor-free graphs
- NP-completeness of some problems concerning voting games
- Kräuter conjecture on permanents is true
- New complexity results about Nash equilibria
- New width parameters for SAT and \#SAT
- On measures of space over real and complex numbers
- Multi-boson correlation sampling
- The permanental process
- On computing small variable disjunction branch-and-bound trees
- Exponential time complexity of the complex weighted Boolean \#CSP
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)
