Pages that link to "Item:Q1090454"

The following pages link to NP is as easy as detecting unique solutions (Q1090454):

Displaying 50 items.

• Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
• Geometric inference for general high-dimensional linear inverse problems (Q309721) (← links)
• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
• Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
• Complexity and approximability of the cover polynomial (Q445242) (← links)
• On a theorem of Razborov (Q445247) (← links)
• A complex analogue of Toda's theorem (Q454132) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• An overview of parallel SAT solving (Q487635) (← links)
• Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
• On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
• The size of SPP (Q596117) (← links)
• Uniqueness of integer solution of linear equations (Q601980) (← links)
• On quasilinear-time complexity theory (Q672330) (← links)
• Computing functions with parallel queries to NP (Q673784) (← 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)
• Deciding uniqueness in norm maximazation (Q687086) (← links)
• Improving known solutions is hard (Q687508) (← links)
• The complexity of explicit constructions (Q693069) (← links)
• Lower bounds and the hardness of counting properties (Q703531) (← links)
• Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
• Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems (Q709108) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
• The power of quantum systems on a line (Q842451) (← links)
• Tensor network contractions for \#SAT (Q887094) (← links)
• Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
• On the complexity of ranking (Q920620) (← links)
• Relations between average-case and worst-case complexity (Q927398) (← links)
• The complexity of equality constraint languages (Q929295) (← links)
• Complexity of unique list colorability (Q935144) (← links)
• Inapproximability of the Tutte polynomial (Q937302) (← links)
• Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
• Parameterized learnability of juntas (Q1034613) (← links)
• The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
• Intractability results in predicate detection (Q1041768) (← links)
• The computational complexity of ideal semantics (Q1045987) (← links)
• Mind change optimal learning of Bayes net structure from dependency and independency data (Q1049405) (← links)
• Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
• Matching is as easy as matrix inversion (Q1095658) (← links)
• Polynomial terse sets (Q1104077) (← links)
• The complexity of optimization problems (Q1107309) (← links)
• The complexity of facets resolved (Q1109565) (← links)
• Promise problems complete for complexity classes (Q1109568) (← links)
• Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
• On the theory of average case complexity (Q1190984) (← links)
• On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)