DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» FO (complexity)
FO (complexity)
Infinitary Logic and Inductive Definability Over Finite Structures
The Complexity Zoo
Canonical Models and the Complexity of Modal Team Logic
User's Guide for Complexity: a LATEX Package, Version 0.80
Descriptive Complexity: a Logician's Approach to Computation
Descriptive Complexity Theories
On the Descriptive Complexity of Color Coding
The Complexity of Tiling Problems
Database Theory
On a Theory of Computation and Complexity Over the Real Numbers: Np-Completeness, Recursive Functions and Universal Machines1
Chapter 1. Cutting out Fragments
DATABASE THEORY Various Notions of Complexity: Combined Complexity (Complexity W.R.T
Descriptive Complexity: a Logicians Approach to Computation
Model-Checking Problem
Utility-Based Control Feedback in a Digital Library Search Engine: Cases in Citeseerx
Scrabble Is PSPACE-Complete
Universal First-Order Logic Is Superfluous for Nl, P, Np and Co Np
Classifying Problems Into Complexity Classes
Top View
Regular Languages in NC’
1 Savitch's Theorem
Citeseerx: a Cloud Perspective
An Overview of Computational Complexity
The Complexity of Relational Queries: a Personal Perspective
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits
A Purely Logical Characterization of Circuit Uniformity (Extended Draft)
A Tetrachotomy for Positive First-Order Logic Without Equality
The Height Premium in Earnings: the Role of Physical Capacity and Cognitive and Non-Cognitive Skills
Tameness in Least Fixed-Point Logic and Mccolm's Conjecture
The Complexity of Decision Problems in Automata Theory and Logic By
A Survey of Quantum Complexity Theory
Day 2 Bolzano, Italy ∀ ¬∃ Logical Foundations of Databases
Descriptive Complexity
Arxiv:1802.05616V1
Fo Model Checking of Interval Graphs∗
Citeseerx: AI in a Digital Library Search Engine
Arxiv:1707.09327V1 [Cs.LO] 28 Jul 2017 H Ocp of Concept the Introduction 1 Rbe Sol H Rto Netniels Fdcso Rbesclassifi S Problems the Decision of [6]
Dyn-FO: a Parallel, Dynamic Complexity Class
Descriptive Complexity and Revealed Preference Theory
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
Complexity of First-Order Logic Topics in Logic and Complexity
Descriptive Complexity of #AC0 Functions
FO Model Checking on Posets of Bounded Width
Grounding FO and FO(ID) with Bounds
FIXED-POINT EXTENSIONS of FIRST-ORDER LOGIC 0. Introduction
Other Complexity Classes and Measures Chapter 29 of the Forthcoming CRC Handbook on Algorithms and Theory of Computation
Lecture 12: Circuit Complexity
Descriptive Complexity
Descriptive Complexity of Real Computation and Probabilistic
First-Order Reductions
Milestones in Descriptive Complexity Theory ANU Logic Summer School, 2019
THE DESCRIPTIVE COMPLEXITY APPROACH to LOGCFL 631 Word Problem of Some Groupoid and That Any Groupoid Word Problem Is Context- Free (See [8, Lemma 3.1])
Lecture 14: PSPACE
Least Fixed Point of a Functor
Inclusion Logic and Fixed Point Logic
Lecture 9: PSPACE
Citeseerx: AI in a Digital Library Search Engine
Lower Bounds for Subgraph Isomorphism and Consequences in First-Order Logic
Answering FO+MOD Queries Under Updates on Bounded Degree Databases∗
Descriptive Complexity of #AC0 Functions∗
A Brief Survey of Inductive Descriptive Complexity
Lecture 4: Non-Regular Languages and Uniformity 1. Overview 2. Our