The following pages link to Kevin J. Compton (Q917542):
Displayed 29 items.
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Nonconvergence, undecidability, and intractability in asymptotic problems (Q1095135) (← links)
- A logical approach to asymptotic combinatorics I. First order properties (Q1103939) (← links)
- Some methods for computing component distribution probabilities in relational structures (Q1105605) (← links)
- The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
- (Q1191026) (redirect page) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- A van der Waerden variant (Q1288044) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Logical definability of counting functions (Q1816735) (← links)
- A logical approach to asymptotic combinatorics. II: Monadic second-order properties (Q2638642) (← links)
- An algebra and a logic for \(NC^ 1\) (Q2638772) (← links)
- The largest set partitioned by a subfamily of a cover (Q2640603) (← links)
- (Q2863862) (← links)
- Some useful preservation theorems (Q3674627) (← links)
- (Q3676129) (← links)
- An undecidable problem in finite combinatorics (Q3718693) (← links)
- Application of a Tauberian theorem to finite model theory (Q3753986) (← links)
- (Q3971252) (← links)
- 0-1 laws for maps (Q4242578) (← links)
- (Q4283229) (← links)
- Expected deadlock time in a multiprocessing system (Q4369875) (← links)
- Fine Spectra and Limit Laws, II First-Order 0–1 Laws (Q4377173) (← links)
- (Q4431384) (← links)
- (Q4525277) (← links)
- (Q4790394) (← links)
- (Q4918393) (← links)
- (Q4938617) (← links)
- Conditional Expectation Bounds with Applications in Cryptography (Q6289620) (← links)