'. '

Search results

From APIDesign

You searched for NC_(complexity)

Jump to: navigation, search

There is no page titled "NC_(complexity)".

For more information about searching APIDesign, see Help.

Showing below up to 20 results starting with #1.


View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500)

No page title matches

Page text matches

  1. ThanksEveryone (7,465 bytes)
    30: ...lie acted as a single access point hiding all the complexity of book publishing from me. Whenever I needed any...
  2. OlderBlogPosts (111,273 bytes)
    658: ...with [[wikipedia::Computational_complexity_theory|complexity theory]] and rather stick with their keyboards or...
    1421: Do you control complexity of your application? What tool do you use? Someth...
  3. ThanksFriends (3,327 bytes)
    11: ...ptual surface]] which is very good way to measure complexity of an API. At the end, Tim is not co-author of [[...
  4. BackwardCompatibility (6,862 bytes)
    13: ...ang]] incompatible revisions, we'll encounter the complexity.
  5. TheYearOfAnnotations2009 (3,433 bytes)
    1: ...y, but without compromises to reliability (as the complexity is kept in the processing infrastructure, not exp...
  6. API has to be Correct (3,865 bytes)
    16: I explain this unnecessary complexity as a result of an ''extreme search for correctnes...
  7. Teleinterface (1,251 bytes)
    1: ...a an interface that does not understand the whole complexity of the communication. Somehow the information flo...
  8. VerificationViaAOP (2,484 bytes)
    1: ... with storage into a separate module, the overall complexity of the code is simplified.
  9. Lookup (7,917 bytes)
    53: ... doing something like that - if using Lookup adds complexity to your code without adding needed flexibility or...
  10. Dependency Injection (7,651 bytes)
    33: ...tialization voluntary and simplifies bits of such complexity.
  11. Modularity (4,941 bytes)
    3: ... reliable. The way to achieve and handle all that complexity is to code applications in a [[Use_Modular_Archit...
  12. LibraryWithoutImplicitExportIsPolynomial (10,196 bytes)
    25: ...mplete]] or whether it enters the polynomial time complexity? Essential property of [[NP-Complete]] problems i...
    57: The complexity of the above algorithm is polynomial. The fact th...
    64: The [[NP-Complete|NP-Complexity]] during compilation seems to be avoided as the c...
  13. TransitivityOfIncompatibleChange (3,458 bytes)
    25: ...ear, but that may be a natural consequence of the complexity of real world module [[dependencies]]. Rather tha...
  14. InvokeDynamic (11,361 bytes)
    5: ...op of [[HotSpot]] virtual machine is of different complexity. When John Rose pushed forward his [[invokeDynami...
  15. Enum (7,264 bytes)
    67: ...es]] is transitive change - just to point out the complexity.
  16. InvisibleAbstractMethod (2,599 bytes)
    43: Some people complained about unnecessary complexity of various [[OOP]] access modifiers - and they we...
  17. GeekOut (4,050 bytes)
    22: ... to get a feel for their power. If you have faced complexity of compilers before, stop by to see how easily is...
  18. Proximity (1,509 bytes)
    23: ...to Many]] one. It does not impose any significant complexity on the users (both [[ClientAPI|clients]] as well ...
  19. JigsawServices (4,966 bytes)
    7: One of the primary suspects for the complexity were [[RangeDependenciesAnalysed|range dependenci...
  20. Gradle (10,710 bytes)
    40: ...bject of [[Wikipedia:halting_problem|unidentified complexity]]. You run it and when it computes the classpath,...

View (previous 20) (next 20) (20 | 50 | 100 | 250 | 500)



Search in namespaces:

List redirects
Search for
Views
buy