BPP Has Subexponential Time Simulations Unless EXPTIME has Publishable Proofs.
László BabaiLance FortnowNoam NisanAvi WigdersonPublished in: Comput. Complex. (1993)
Keyphrases
- description logics
- upper bound
- bit rate
- first order logic
- decision problems
- exact solution
- multiresolution
- expressive description logics
- decision procedures
- theorem proving
- simulation model
- compression ratio
- numerical simulations
- step size
- theorem prover
- simulation environment
- image quality
- tree automata
- expert systems
- formal proofs