scientific article; zbMATH DE number 1072530
From MaRDI portal
Publication:4359457
zbMATH Open0880.68039MaRDI QIDQ4359457FDOQ4359457
Authors: Lance Fortnow 
Publication date: 8 October 1997
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- Efficient verification of Tunnell's criterion
- Simulating counting oracles with cooperation
- On Toda’s Theorem in Structural Communication Complexity
- Complexity dichotomies of counting problems
- Lower bounds and the hardness of counting properties
- Complexity limitations on one-turn quantum refereed games
- On the probabilistic closure of the loose unambiguous hierarchy
- Descriptive complexity for counting complexity classes
- Relating polynomial time to constant depth
- Effective Poset Inequalities
- Complexity of counting the optimal solutions
- A second step towards complexity-theoretic analogs of Rice's Theorem
- The size of SPP
- An oracle builder's toolkit
- Computational complexity of counting coincidences
- Title not available (Why is that?)
- On the algebraic complexity of some families of coloured Tutte polynomials
- Relativized worlds with an infinite hierarchy
- The complexity of counting problems
- On a theorem of Razborov
- The counting power of P systems with antimatter
- Generality's price: Inescapable deficiencies in machine-learned programs
- Complexity of Counting the Optimal Solutions
- Counting Value Sets: Algorithm and Complexity
- On the counting complexity of mathematical nanosciences
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359457)
