The following pages link to FRAGMENTS OF APPROXIMATE COUNTING (Q2921008):
Displaying 9 items.
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Random resolution refutations (Q2311546) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- A feasible interpolation for random resolution (Q2980967) (← links)
- Randomized feasible interpolation and monotone circuits with a local oracle (Q4562441) (← links)
- INCOMPLETENESS IN THE FINITE DOMAIN (Q4640304) (← links)
