Bilaketaren emaitzak - function decomposition programming recursion complexity theory*

Iradokizunak:
decomposition programming » compositive programming , copositive programming , computation programming
function decomposition » functional decomposition , factor decomposition
programming recursion » programming decision , programming session , programming decisions
recursion complexity » recursions complexity , recursive complexity , regulation complexity

Automata, Languages and Programming 35th International Colloquium, ICALP 2008 Reykjavik, Iceland, July 7-11, 2008 Proceedings, Part I /

Argitaratua 2008

Aurkibidea: “... -- The Complexity of Boolean Formula Minimization -- Optimal Cryptographic Hardness of Learning Monotone Functions...”
Testu osoa

Baliabide elektronikoa eBook

Automata, Languages and Programming 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings /

Argitaratua 2007

Aurkibidea: “... Multiparty Communication Complexity -- Session A5 -- An Optimal Decomposition Algorithm for Tree Edit...”
Testu osoa

Baliabide elektronikoa eBook

Foundations of Software Science and Computation Structures 16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Sof...

Argitaratua 2013

Aurkibidea: “... for Non-local Control Flow and Block Scope Variables -- The Parametric Ordinal-Recursive Complexity...”
Testu osoa

Baliabide elektronikoa eBook

Computer Science Logic 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, Proceedings /

Argitaratua 2005

Aurkibidea: “... -- Identifying Polynomial-Time Recursive Functions -- Confluence of Shallow Right-Linear Rewrite Systems...”
Testu osoa

Baliabide elektronikoa eBook

Perspectives of System Informatics 9th International Ershov Informatics Conference, PSI 2014, St. Petersburg, Russia, June 24-27, 2014. Revised Selected Papers /

Argitaratua 2015

Aurkibidea: “... of Functional Programs -- Lingva: Generating and Proving Program Properties Using Symbol -- Neutralizing...”
Testu osoa

Baliabide elektronikoa eBook

Computer Science -- Theory and Applications First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings /

Argitaratua 2006

Aurkibidea: “...Invited Papers -- Non-black-box Techniques in Cryptography -- Complexity of Polynomial...”
Testu osoa

Baliabide elektronikoa eBook

Fundamentals of Computation Theory 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings /

Argitaratua 2005

Aurkibidea: “... Recursive Oracles for Relativized Polynomial Hierarchies -- Graphs and Complexity -- Exact Algorithms...”
Testu osoa

Baliabide elektronikoa eBook

Computer Aided Verification 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014, Proceedings /

Argitaratua 2014

Aurkibidea: “... -- Symbolic Resource Bound Inference for Functional Programs -- Proving Non-termination Using Max-SMT...”
Testu osoa

Baliabide elektronikoa eBook

SOFSEM 2008: Theory and Practice of Computer Science 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Pro...

Argitaratua 2008

Aurkibidea: “... Specifications for Distributed Program Synthesis -- Exact OBDD Bounds for Some Fundamental Functions...”
Testu osoa

Baliabide elektronikoa eBook

Machine Learning and Data Mining in Pattern Recognition 4th International Conference, MLDM 2005, Leipzig, Germany, July 9-11, 2005, Proceedings /

Argitaratua 2005

Aurkibidea: “... with Different Subspace Classification -- Clustering: Basics -- Using Clustering to Learn Distance Functions...”
Testu osoa

Baliabide elektronikoa eBook

Emaitzak murriztu