Items where Subject is "68-XX Computer science > 68Qxx Theory of computing > 68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: D | F | H
Number of items at this level: 4.

D

Damm, Frank and Heider, Franz-Peter (1996) Amplifying the Security of One-Way Functions -- A Proof of Yao's XOR-Lemma.
Technical Report , 13 p.

F

Fellows, Michael and Kratochvil, Jan and Middendorf, Matthias and Pfeiffer, Frank (1995) The Complexity of Induced Minors and Related Problems.
Published in: Algorithmica Vol. 13 (3). pp. 266-282.

H

Heusch, Peter (1995) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published In: Mathematical foundations of computer science 1995 : 20th international symposium ; proceedings, Lecture notes in computer science. 969 Springer 1995, pp. 221-226.

Heusch, Peter (1999) The Complexity of the Falsifiability Problem for Pure Implicational Formulas.
Published in: Discrete Applied Mathematics Vol. 96-97. pp. 127-138.

This list was generated on Tue Dec 12 07:19:34 2017 CET.