FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

This page contains an index consisting of author-provided keywords.

A
abstract recursion theory	Computability over locally finite structures from algebra
approximate counting	Feasibly constructive proofs of succinct weak circuit lower bounds
B
bounded arithmetic	Feasibly constructive proofs of succinct weak circuit lower bounds
C
circuit lower bounds	Feasibly constructive proofs of succinct weak circuit lower bounds
Complexity Analysis	A General Equational Framework for Static Profiling of Parametric Resource Usage
computational complexity	Computability over locally finite structures from algebra Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties
cons-free computation	Computability over locally finite structures from algebra
D
descriptive complexity	Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties
F
field theory	Computability over locally finite structures from algebra
first-order logic	Traversal-invariant definability and Logarithmic-space computation
Function algebras	A recursion-theoretic characterisation of the positive polynomial-time functions
Function classes	A recursion-theoretic characterisation of the positive polynomial-time functions
G
graph theory	Completeness in the Second Level of the Polynomial Time Hierarchy through Syntactic Properties
I
implicit complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
L
logarithmic space computation	Traversal-invariant definability and Logarithmic-space computation
logic	A recursion-theoretic characterisation of the positive polynomial-time functions
M
Monotone complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
N
natural proofs	Feasibly constructive proofs of succinct weak circuit lower bounds
O
order invariant definability	Traversal-invariant definability and Logarithmic-space computation
P
Positive complexity	A recursion-theoretic characterisation of the positive polynomial-time functions
proof complexity	Feasibly constructive proofs of succinct weak circuit lower bounds
R
Recursion-theoretic characterisations	A recursion-theoretic characterisation of the positive polynomial-time functions
Resource Usage Analysis	A General Equational Framework for Static Profiling of Parametric Resource Usage
S
Static Analysis	A General Equational Framework for Static Profiling of Parametric Resource Usage
Static Profiling	A General Equational Framework for Static Profiling of Parametric Resource Usage

Disclaimer | Powered by EasyChair Smart Program