Lecture Notes in Computer Science - Theory and Applications of Models of Computation
Latest Publications

TOTAL DOCUMENTS

75

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540340218, 9783540340225

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Generic Set That Does Not Bound a Minimal Pair

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_71 ◽

2006 ◽

pp. 746-755

Author(s):

Mariya Ivanova Soskova

Keyword(s):

Minimal Pair ◽

Download Full-text

The Trade-Off Theorem and Fragments of Gödel’s T

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_62 ◽

2006 ◽

pp. 654-674 ◽

Author(s):

Lars Kristiansen ◽

Paul J. Voda

Keyword(s):

Trade Off ◽

Download Full-text

Improved SAT Based Bounded Model Checking

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_58 ◽

2006 ◽

pp. 611-620 ◽

Author(s):

Conghua Zhou ◽

Decheng Ding

Keyword(s):

Model Checking ◽

Bounded Model Checking

Download Full-text

Identity-Based Threshold Proxy Signature Scheme with Known Signers

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_51 ◽

2006 ◽

pp. 538-546 ◽

Author(s):

Haiyong Bao ◽

Zhenfu Cao ◽

Shengbao Wang

Keyword(s):

Proxy Signature ◽

Signature Scheme ◽

Identity Based ◽

Threshold Proxy Signature

Download Full-text

Models of Intuitionistic Set Theories over Partial Combinatory Algebras

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_5 ◽

2006 ◽

pp. 68-78 ◽

Author(s):

Michael Rathjen

Download Full-text

Analyzing Chain Programs over Difference Constraints

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_16 ◽

2006 ◽

pp. 171-180

Author(s):

K. Subramani ◽

John Argentieri

Keyword(s):

Difference Constraints

Download Full-text

Generalized Counters and Reversal Complexity

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_30 ◽

2006 ◽

pp. 318-326

Author(s):

M. V. Panduranga Rao

Download Full-text

LS-SVM Based on Chaotic Particle Swarm Optimization with Simulated Annealing

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_9 ◽

2006 ◽

pp. 99-107 ◽

Author(s):

Ai-ling Chen ◽

Zhi-ming Wu ◽

Gen-ke Yang

Keyword(s):

Particle Swarm Optimization ◽

Simulated Annealing ◽

Particle Swarm ◽

Swarm Optimization ◽

Chaotic Particle Swarm Optimization

Download Full-text

Valiant’s Holant Theorem and Matchgate Tensors

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_24 ◽

2006 ◽

pp. 248-261 ◽

Author(s):

Jin-Yi Cai ◽

Vinay Choudhary

Download Full-text

Optimization Problems in the Polynomial-Time Hierarchy

Lecture Notes in Computer Science - Theory and Applications of Models of Computation ◽

10.1007/11750321_33 ◽

2006 ◽

pp. 345-355

Author(s):

Christopher Umans

Keyword(s):

Polynomial Time ◽

Optimization Problems ◽

Polynomial Time Hierarchy

Download Full-text