Pages that link to "Item:Q600247"
From MaRDI portal
The following pages link to The complexity of computing the permanent (Q600247):
Displayed 50 items.
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Algorithms for four variants of the exact satisfiability problem (Q596105) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- A theory of even functionals and their algorithmic applications (Q672856) (← links)
- Independent sets versus perfect matchings (Q673116) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- Approximation algorithm for DNF under distributions with limited independence (Q675867) (← links)
- Mathematical aspects of concept analysis (Q676803) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Arithmetization: A new method in structural complexity theory (Q685721) (← links)
- Non-deterministic exponential time has two-prover interactive protocols (Q685724) (← links)
- Almost all trees are co-immanantal (Q751666) (← links)
- On the succinct representation of graphs (Q800734) (← links)
- On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
- A note on enumerative counting (Q809598) (← links)
- Similarity of personal preferences: Theoretical foundations and empirical analysis (Q814460) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Random path method with pivoting for computing permanents of matrices (Q870138) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- The complexity of determinacy problem on group testing (Q913514) (← links)
- NP-completeness of some problems concerning voting games (Q918448) (← links)
- On the complexity of ranking (Q920620) (← links)
- The computational complexity of evolutionarily stable strategies (Q926196) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Inequalities and identities for generalized matrix functions (Q1057339) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- The complexity of counting homeomorphs (Q1058852) (← links)
- On some natural complete operators (Q1064780) (← links)
- Games against nature (Q1069296) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
- On the computational complexity of the order polynomial (Q1086595) (← links)
- Approximation to measurable functions and its relation to probabilistic computation (Q1088659) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery (Q1095944) (← links)
- Permanent and determinant (Q1097929) (← links)
- Some observations on the connection between counting and recursion (Q1098837) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- On two extremal matrix problems (Q1115936) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Degree switching operations in networks and large scale systems assignment problems (Q1139029) (← links)
- Combinatorial problems over power sets (Q1143948) (← links)
- On efficient computation of the coefficients of some polynomials with applications to some enumeration problems (Q1152953) (← links)
- Division in idealized unit cost RAMs (Q1159982) (← links)