Pages that link to "Item:Q1894456"

The following pages link to Descriptive complexity of \(\#\)P functions (Q1894456):

Displaying 23 items.

• Counting problems over the reals (Q1575534) (← links)
• On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) (Q1816726) (← links)
• Logical definability of counting functions (Q1816735) (← links)
• The relative complexity of approximate counting problems (Q1879247) (← links)
• Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
• A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
• Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
• A model-theoretic characterization of constant-depth arithmetic circuits (Q2273012) (← links)
• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
• Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
• On the descriptive complexity of \(\overline{\varSigma ^*\overline{L}}\) (Q2408805) (← links)
• On the connection between interval size functions and path counting (Q2410681) (← links)
• Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
• The complexity of counting problems (Q2776272) (← links)
• On Approximation Algorithms for # P (Q3718150) (← links)
• (Q4945215) (← links)
• An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
• Counting of Teams in First-Order Team Logics (Q5092378) (← links)
• (Q5216300) (← links)
• Completeness Results for Counting Problems with Easy Decision (Q5283355) (← links)
• Membrane Computing (Q5316634) (← links)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
• Weighted automata and logics meet computational complexity (Q6647756) (← links)