• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 27 matches

• 2021
• 
  Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, David Furcy, Matthew J. Patitz, Robert T. Schweller, Scott M. Summers, Andrew Winslow:
  On the effects of hierarchical self-assembly for reducing program-size complexity. Theor. Comput. Sci. 894: 50-78 (2021)
• 2020
• 
  Aliyu Sani Sambo, R. Muhammad Atif Azad, Yevgeniya Kovalchuk, Vivek Padmanaabhan Indramohan, Hanifa Shah:
  Time Control or Size Control? Reducing Complexity and Improving Accuracy of Genetic Programming Models. EuroGP 2020: 195-210
• 
  Pierre-Étienne Meunier, Damien Regnault, Damien Woods:
  The program-size complexity of self-assembled paths. STOC 2020: 727-737
• 
  Pierre-Étienne Meunier, Damien Regnault, Damien Woods:
  The program-size complexity of self-assembled paths. CoRR abs/2002.04012 (2020)
• 2017
• 
  David Furcy, Samuel Micka, Scott M. Summers:
  Optimal Program-Size Complexity for Self-Assembled Squares at Temperature 1 in 3D. Algorithmica 77(4): 1240-1282 (2017)
• 
  Martin Avanzini, Ugo Dal Lago:
  Automating sized-type inference for complexity analysis. Proc. ACM Program. Lang. 1(ICFP): 43:1-43:29 (2017)
• 2016
• 
  Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
  Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38(4): 13:1-13:50 (2016)
• 
  John Case, James S. Royer:
  Program Size Complexity of Correction Grammars in the Ershov Hierarchy. CiE 2016: 240-250
• 2015
• 
  David Furcy, Samuel Micka, Scott M. Summers:
  Optimal Program-Size Complexity for Self-Assembly at Temperature 1 in 3D. DNA 2015: 71-86
• 2014
• 
  Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
  Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155
• 
  David Furcy, Samuel Micka, Scott M. Summers:
  Optimal program-size complexity for self-assembly at temperature 1 in 3D. CoRR abs/1411.1122 (2014)
• 2012
• 
  Michael J. Dinneen:
  A Program-Size Complexity Measure for Mathematical Problems and Conjectures. Computation, Physics and Beyond 2012: 81-93
• 2011
• 
  Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
  Program-size versus Time Complexity Slowdown and Speed-up Phenomena in the Micro-cosmos of Small Turing Machines. Int. J. Unconv. Comput. 7(5): 353-387 (2011)
• 
  Joost J. Joosten, Fernando Soler-Toscano, Hector Zenil:
  Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena in Small Turing Machines. CoRR abs/1102.5389 (2011)
• 2010
• 
  Ben Reichardt:
  Least span program witness size equals the general adversary lower bound on quantum query complexity. Electron. Colloquium Comput. Complex. 17: 75 (2010)
• 2008
• 
  Kristoffer Arnsfelt Hansen:
  Constant Width Planar Branching Programs Characterize ACC0 in Quasipolynomial Size. Computational Complexity Conference 2008: 92-99
• 2006
• 
  Alan Piszcz, Terence Soule:
  Genetic programming: optimal population sizes for varying complexity problems. GECCO 2006: 953-954
• 2005
• 
  Verónica Becher, Santiago Figueira, André Nies, Silvana Picchi:
  Program Size Complexity for Possibly Infinite Computations. Notre Dame J. Formal Log. 46(1): 51-64 (2005)
• 2002
• 
  Peter D. Turney:
  Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification. CoRR cs.LG/0212039 (2002)
• 2000
• 
  Paul W. K. Rothemund, Erik Winfree:
  The program-size complexity of self-assembled squares (extended abstract). STOC 2000: 459-468
• 1999
• 
  Cristian Calude, Richard J. Coles:
  Program-Size Complexity of Initial Segments and Domination Reducibility. Jewels are Forever 1999: 225-237
• 1995
• 
  Gregory J. Chaitin, Asat Arslanov, Cristian Calude:
  Program-size Complexity Computes the Halting Problem. Bull. EATCS 57 (1995)
• 1993
• 
  En-Hui Yang, Shi-Yi Shen:
  Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function. IEEE Trans. Inf. Theory 39(1): 288-292 (1993)
• 1992
• 
  Arne Maus:
  Entropy as a Complexity Measure, and the Optimal Module Size of Object Oriented Programs. IFIP Congress (1) 1992: 17-23
• 1987
• 
  Jack W. Davidson, Richard A. Vaughan:
  The Effect of Instruction Set Complexity on Program Size and Memory Performance. ASPLOS 1987: 60-64
• 1981
• 
  Howard P. Katseff, Michael Sipser:
  Several Results in Program Size Complexity. Theor. Comput. Sci. 15: 291-309 (1981)
• 1977
• 
  Howard P. Katseff, Michael Sipser:
  Several Results in Program Size Complexity. FOCS 1977: 82-89