scientific article; zbMATH DE number 1072530
From MaRDI portal
Publication:4359457
zbMath0880.68039MaRDI QIDQ4359457
Publication date: 8 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Generality's price: Inescapable deficiencies in machine-learned programs ⋮ Complexity of counting the optimal solutions ⋮ Unnamed Item ⋮ The size of SPP ⋮ The counting power of P systems with antimatter ⋮ Complexity limitations on one-turn quantum refereed games ⋮ Effective Poset Inequalities ⋮ An oracle builder's toolkit ⋮ Complexity of Counting the Optimal Solutions ⋮ On a theorem of Razborov ⋮ On the algebraic complexity of some families of coloured Tutte polynomials ⋮ Simulating counting oracles with cooperation ⋮ Efficient verification of Tunnell's criterion ⋮ Lower bounds and the hardness of counting properties ⋮ On Toda’s Theorem in Structural Communication Complexity ⋮ Relating polynomial time to constant depth ⋮ A second step towards complexity-theoretic analogs of Rice's Theorem ⋮ On the probabilistic closure of the loose unambiguous hierarchy ⋮ Relativized worlds with an infinite hierarchy
This page was built for publication:
