Rainer Schuler

From MaRDI portal
Revision as of 11:03, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:598181

Available identifiers

zbMath Open schuler.rainerMaRDI QIDQ598181

List of research outcomes





PublicationDate of PublicationType
Sets computable in polynomial time on average2023-12-12Paper
Structure in average case complexity2023-03-21Paper
The complexity of generating test instances2022-11-09Paper
Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation2020-05-06Paper
Switch-like behavior enables Wnt11 concentration specific response during dorso-ventral axis formation in \textit{Xenopus laevis}2018-03-09Paper
Average polynomial time is hard for exponential time under sn-reductions2017-01-19Paper
Algorithms and Computation2009-08-07Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
https://portal.mardi4nfdi.de/entity/Q36337412009-06-23Paper
Randomized algorithms for 3-SAT2007-03-12Paper
Computing and Combinatorics2006-01-11Paper
An algorithm for the satisfiability problem of formulas in conjunctive normal form2005-02-22Paper
https://portal.mardi4nfdi.de/entity/Q47368392004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47376732004-08-11Paper
Average-case intractability vs. worst-case intractability2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44146662003-07-25Paper
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems2002-12-01Paper
https://portal.mardi4nfdi.de/entity/Q45483382002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q27624962002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q45256942001-01-24Paper
Resource-bounded measure and learnability2000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q42585901999-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42599991999-09-08Paper
https://portal.mardi4nfdi.de/entity/Q42510611999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q42181231998-11-11Paper
If NP has polynomial-size circuits, then MA=AM1997-02-28Paper
Some properties of sets tractable under every polynomial-time computable distribution1997-02-27Paper
Structural average case complexity1997-01-27Paper
ON HELPING AND INTERACTIVE PROOF SYSTEMS1995-10-29Paper
Random languages for nonuniform complexity classes1992-06-26Paper

Research outcomes over time

This page was built for person: Rainer Schuler

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:598181&oldid=6032118"
Powered by MediaWiki