The following pages link to (Q4058132):
Displaying 50 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- A theoretical framework for knowledge-based entity resolution (Q402127) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- The intractability of computing the Hamming distance (Q557834) (← links)
- Partition semantics for relations (Q579957) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- Equilibrium semantics of languages of imperfect information (Q636301) (← links)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information (Q645985) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Negation in rule-based database languages: A survey (Q753476) (← links)
- On Horn spectra (Q757356) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- On the separability of subproblems in Benders decompositions (Q846136) (← links)
- Complexity of admissible rules (Q868660) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- First-order spectra with one variable (Q909462) (← links)
- 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- Complexity classes for self-assembling flexible tiles (Q1004079) (← links)
- Mathematical logic and quantum finite state automata (Q1017412) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- Complexity classes and fragments of C (Q1029017) (← links)
- Lower bound results on lengths of second-order formulas (Q1071760) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- Tree-like parse and polynomial subclasses of search problems (Q1082828) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- Upper and lower bounds for first order expressibility (Q1173404) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- On the expressive power of database queries with intermediate types (Q1176290) (← links)
- A note on the approximation of the MAX CLIQUE problem (Q1183423) (← links)
- An analysis of fixed-point queries on binary trees (Q1183571) (← links)
- An NP-complete language accepted in linear time by a one-tape Turing machine (Q1183577) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
- Quantifiers and approximation (Q1208413) (← links)
