Computer Science - Theory and Applications - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

33

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642033506, 9783642033513

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

k-SAT Is No Harder Than Decision-Unique-k-SAT

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_8 ◽

2009 ◽

pp. 59-70 ◽

Author(s):

Chris Calabro ◽

Ramamohan Paturi

Download Full-text

Formal Verification of Gate-Level Computer Systems

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_30 ◽

2009 ◽

pp. 322-333 ◽

Author(s):

Mark Hillebrand ◽

Sergey Tverdyshev

Keyword(s):

Formal Verification ◽

Computer Systems

Download Full-text

Kolmogorov Complexity and Model Selection

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_3 ◽

2009 ◽

pp. 19-24

Author(s):

Nikolay Vereshchagin

Keyword(s):

Model Selection ◽

Kolmogorov Complexity

Download Full-text

Structural Complexity of AvgBPP

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_16 ◽

2009 ◽

pp. 155-166 ◽

Author(s):

Dmitry Itsykson

Keyword(s):

Structural Complexity

Download Full-text

On Random Ordering Constraints

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_12 ◽

2009 ◽

pp. 105-116 ◽

Author(s):

Andreas Goerdt

Keyword(s):

Ordering Constraints

Download Full-text

Well-Founded and Partial Stable Semantics Logical Aspects

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_1 ◽

2009 ◽

pp. 1-11

Author(s):

Pedro Cabalar ◽

Sergei Odintsov ◽

David Pearce

Keyword(s):

Stable Semantics

Download Full-text

Approximability Distance in the Space of H-Colourability Problems

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_11 ◽

2009 ◽

pp. 92-104 ◽

Author(s):

Tommy Färnqvist ◽

Peter Jonsson ◽

Johan Thapper

Download Full-text

Languages Recognized with Unbounded Error by Quantum Finite Automata

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_33 ◽

2009 ◽

pp. 356-367 ◽

Author(s):

Abuzer Yakaryilmaz ◽

A. C. Cem Say

Keyword(s):

Finite Automata ◽

Quantum Finite Automata

Download Full-text

Depth Reduction for Circuits with a Single Layer of Modular Counting Gates

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_13 ◽

2009 ◽

pp. 117-128 ◽

Author(s):

Kristoffer Arnsfelt Hansen

Keyword(s):

Single Layer ◽

Modular Counting ◽

Depth Reduction

Download Full-text

On Models of a Nondeterministic Computation

Computer Science - Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03351-3_31 ◽

2009 ◽

pp. 334-345 ◽

Author(s):

Mikhail N. Vyalyi

Download Full-text