This is TikiWiki v1.9.8.3 -Sirius- © 2002–2007 by the Tiki community Mon 03 of Oct, 2022 [08:59 UTC]

Category F.1.3 Complexity Measures and Classes

Complexity hierarchies Machine-independent complexity Reducibility and completeness Relations among complexity classes Relations among complexity measures
Browse in:
All Wiki pages Image galleries Images File galleries Blogs Trackers Items Surveys Articles

search category: deep:

Show subcategories objects


Objects (2)

Article ON HYPERSIMPLE wtt -MITOTIC SETS, WHICH ARE NOT tt -MITOTIC Abstract: A ΠΆ-complete wtt-mitotic set is composed, which is not tt-mitotic. A relation is found out between structure of computably enumerable sets and the density of their unsolvability degrees.  
Article Review of some problems on the complexity of simultaneous divisibility of linear Abstract: An introduction to the problems considering complexity of simultaneous divisibilities of values of linear polynomials is presented. Some history facts, recent results and open questions tha 

Page: 1/1
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.20 secs ]   [ Memory usage: 9.08MB ]   [ GZIP Disabled ]   [ Server load: 1.36 ]