Concepedia

Jim Kadin

JK

Statistics

Publications

13

Citations

499

H-Index

12

Active since

1985

Affiliations

Cornell University(Current)

University of Maine

Universität Ulm

Jim Kadin is an author at Cornell University specializing in engineering, computer science, and computational complexity.

Top concepts

EngineeringComputer ScienceComputational ComplexityAutomated ReasoningFormal MethodsCircuit ComplexityDiscrete MathematicsProof ComplexityFormal VerificationCombinatorial Optimization

Publications per year

1985–2002

13

Publications

13

The Polynomial Time Hierarchy Collapses If the Boolean Hierarchy Collapses

Jim Kadin · SIAM Journal on Computing · 1988 · 125 citations

Circuit Complexity, Computational Complexity Theory, Engineering +15

PNP[(log )] and sparse turing-complete sets for NP

Jim Kadin · Journal of Computer and System Sciences · 1989 · 96 citations

Computational Complexity Theory, Engineering, Sparse Turing-complete Sets +7

The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection

Richard Chang, Jim Kadin · SIAM Journal on Computing · 1996 · 65 citations

Circuit Complexity, Computational Logic, Algebraic Logic +15

On computing Boolean connectives of characteristic functions

Richard Chang, Jim Kadin · Theory of Computing Systems · 1995 · 44 citations

Circuit Complexity, Engineering, Boolean Function +4

The delta rule development system for speech synthesis from text

Sue Hertz, Jim Kadin, Kevin Karplus · Proceedings of the IEEE · 1985 · 26 citations

Engineering, Speech Corpus, Spoken Language Processing +21

1–5 of 13