×
+ All Categories
Log in
English
Français
Español
Deutsch
Report -
Definability of Cai-Fürer-Immerman Problems in Choiceless ...polynomial time: 1 For every sentence 2L, the set of nite models of is decidable in polynomial time. 2 For every Ptime-property
Name
Email
Select
Select
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Message
Please pass captcha verification before submit form