Author of the publication

The complexity of finding middle elements.

, and . Technical Report, 53. Department of Computer Science, (January 1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Playing with Boolean Blocks: Post's Lattice with Applications to Complexity Theory., , , and . Technical Report, 317. Department of Computer Science, (February 2004)Simple Bases for Boolean Co-Clones., , , and . Technical Report, 350. Department of Computer Science, (January 2005)Playing with Boolean Blocks: Constraint Satisfaction Problems., , , and . Technical Report, 318. Department of Computer Science, (February 2004)44. Workshop über Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen., and . Technical Report, 277. Department of Computer Science, (July 2001)A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks., , , and . Technical Report, 264. Department of Computer Science, (August 2000)A Note on the Power of Quasipolynomial Size Circuits.. Technical Report, 140. Department of Computer Science, (June 1996)Relating Polynomial Time to Constant Depth.. Technical Report, 179. Department of Computer Science, (August 1997)Classes of counting functions and complexity theoretic operators., and . Technical Report, 31. Department of Computer Science, (August 1991)Dependence logic with a majority quantifier, , , and . CoRR, (2011)Logics for Dependence and Independence (Dagstuhl Seminar 19031)., , , and . Dagstuhl Reports, 9 (1): 28-46 (2019)