Polynomially Complete Problems in the Logic of Automated Discovery.

Pavel Pudlk

Browse the full MFCS paper archive.