The following pages link to Jerzy Tyszkiewicz (Q290270):
Displaying 25 items.
- A note on the Kolmogorov data complexity and nonuniform logical definitions (Q290271) (← links)
- The navigational power of web browsers (Q692917) (← links)
- Probabilistic properties of approximation problems (Q1197604) (← links)
- The Kolmogorov expression complexity of logics (Q1363784) (← links)
- The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
- Definability of connectives in conditional event algebras of Schay-Adams-Calabrese and Goodman-Nguyen-Walker (Q1603467) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- On the expressive power of semijoin queries (Q2390289) (← links)
- The semijoin algebra and the guarded fragment (Q2567344) (← links)
- A Simple Construction for Tournaments with Every k Players Beaten by a Single Player (Q2757422) (← links)
- Complexity of Type Inference (Q3000286) (← links)
- (Q4202960) (← links)
- (Q4283251) (← links)
- Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic (Q4288891) (← links)
- (Q4329012) (← links)
- (Q4359313) (← links)
- (Q4381707) (← links)
- SO(∀∃*) Sentences and Their Asymptotic Probabilities (Q4521119) (← links)
- Statistical properties of simple types (Q4526148) (← links)
- Probabilities in first—order logic of a unary function and a binary relation (Q4697808) (← links)
- (Q4737206) (← links)
- On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering (Q5044764) (← links)
- The Power of Spreadsheet Computations (Q5049057) (← links)
- On the Fixpoint Theory of Equality and Its Applications (Q5459195) (← links)
- Conditionals, Information, and Inference (Q5464023) (← links)
