CFP: LCC'06 - Workshop on Logic and Computational Complexity




CALL FOR PAPERS: 8th Intl Workshop on Logic and Computational Complexity
------------------------------------------------------------------------

The Logic and Computational Complexity Workshop, LCC'06, will be
part of the 2006 Federated Logic Conference, FLoC'06, and
satellite workshop of the Logic in Computer Science Conference,
LICS'06, in Seattle, Washington, August 10-11, 2006.

SCOPE

The workshop aims at furthering an understanding of the fundamental
relations between computational complexity and logic. Topics of
interest include:

* complexity analysis for functional languages
* complexity in database theory
* complexity in formal methods
* computational complexity in higher types
* formal methods for complexity analysis of programs
* foundations of implicit computational complexity
* logical & machine-independent characterizations of complexity classes
* logics closely related to complexity classes
* proof complexity
* semantic approaches to complexity
* software that applies LCC ideas
* type systems for controlling complexity

FORMAT

The program will consist of sessions of contributed papers, invited
talks, and software demonstrations.

PAPER SUBMISSION

The deadline for submissions is June 12, 2006. See the workshop
webpage, http://www.cis.syr.edu/~royer/lcc/LCC06/, for submission
details.

PROGRAM COMMITTEE

* Georg Gottlob (University of Oxford)
* Neil Immerman (University of Massachusetts, Amherst) co-chair
* Russell Impagliazzo (University of California, San Diego)
* Neil Jones (University of Copenhagen)
* Bruce Kapron (University of Victoria) co-chair
* Harry Mairson (Brandeis University)
* Karl-Heinz Niggl (University of Technology, Ilmenau)
* Toniann Pitassi (University of Toronto)
* Thomas Schwentick (University of Dortmund)
* Colin Stirling (University of Edinburgh)

IMPORTANT DATES

June 12 The submission deadline
July 5 Notification of authors of accepted papers
August 10-11 Workshop Dates
August 12-15 LICS'05 Dates

WEB PAGES

The LCC home page: http://www.cis.syr.edu/~royer/lcc/
The LICS home page: http://www.lfcs.informatics.ed.ac.uk/lics
The FLoC home page: http://research.microsoft.com/floc06/

CONTACT INFORMATION

James S. Royer
Department of Electrial Engineering and Computer Science
Syracuse University
Syracuse, NY 13244 USA
Email: someone@someplace
where somplace=ecs.syr.edu and someone=royer
.



Relevant Pages

  • CFP: LCC06 - Workshop on Logic and Computational Complexity
    ... CALL FOR PAPERS: 8th Intl Workshop on Logic and Computational Complexity ... logics closely related to complexity classes ...
    (comp.lang.functional)
  • CFP: LCC06 - Workshop on Logic and Computational Complexity
    ... CALL FOR PAPERS: 8th Intl Workshop on Logic and Computational Complexity ... logics closely related to complexity classes ...
    (comp.theory)
  • Re: Noob question on complexity of emulated machines?
    ... w/ complexity as it applies to modern computers, ... hierarchy (LTH) that is analogous to the polynomial-time hierarchy. ... everything there is to know about computational complexity theory?" ... The idea of emulating an NTM on another NTM got me wondering about LTH, ...
    (comp.theory)
  • Re: Quantum Computer vs. crypto
    ... >> QC really only offers an exponential speedup to fourier transforms. ... in the context of communication complexity (opposed to computational ... Uh, it was computational complexity I was talking about, and would love to ...
    (sci.crypt)
  • ADDCT07: CFP: Abstract Submission Deadline May 4
    ... complexity) often occur in mathematics, in program verification, ... analyzing decidability in combinations of theories and possibilities ... Simultaneous submission of material is prohibited. ... Presentation-only papers: ...
    (comp.specification.z)