FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

Disclaimer | Powered by EasyChair Smart Program